FINDING THE MINIMUM BANDWIDTH OF AN INTERVAL GRAPH

被引：19

|

作者：

KRATSCH, D

机构：

来源：

INFORMATION AND COMPUTATION | 1987年 / 74卷 / 02期

关键词：

D O I：

10.1016/0890-5401(87)90028-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：140 / 158

页数：19

相关论文

共 50 条

[1] ON FINDING THE MINIMUM BANDWIDTH OF INTERVAL-GRAPHS
MAHESH, R
RANGAN, CP
SRINIVASAN, A
INFORMATION AND COMPUTATION, 1991, 95 (02) : 218 - 224
[2] Interval degree and bandwidth of a graph
Fomin, FV
Golovach, PA
DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) : 345 - 359
[3] FINDING A MINIMUM CIRCUIT IN A GRAPH
ITAI, A
RODEH, M
SIAM JOURNAL ON COMPUTING, 1978, 7 (04) : 413 - 423
[4] FINDING A MINIMUM EQUIVALENT GRAPH OF A DIGRAPH
MARTELLO, S
TOTH, P
NETWORKS, 1982, 12 (02) : 89 - 100
[5] On the complexity of finding a minimum cycle cover of a graph
Thomassen, C
SIAM JOURNAL ON COMPUTING, 1997, 26 (03) : 675 - 677
[6] AN ALGORITHM FOR FINDING A MINIMUM EQUIVALENT GRAPH OF A DIGRAPH
MOYLES, DM
THOMPSON, GL
JOURNAL OF THE ACM, 1969, 16 (03) : 455 - &
[7] Finding the root graph through minimum edge deletion
Labbe, Martine
Marin, Alfredo
Pelegrin, Mercedes
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (01) : 59 - 74
[8] METHODS OF FINDING ALL MINIMUM COVERINGS OF A GRAPH BY CLIQUES
BRATTSEVA, YV
CHERENIN, VP
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1994, 34 (8-9) : 1103 - 1118
[9] FINDING A MINIMUM INDEPENDENT DOMINATING SET IN A PERMUTATION GRAPH
ATALLAH, MJ
MANACHER, GK
URRUTIA, J
DISCRETE APPLIED MATHEMATICS, 1988, 21 (03) : 177 - 183
[10] A FASTER ALGORITHM FOR FINDING THE MINIMUM CUT IN A DIRECTED GRAPH
HAO, JX
ORLIN, JB
JOURNAL OF ALGORITHMS, 1994, 17 (03) : 424 - 446

← 1 2 3 4 5 →