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 条

[11] A polynomial time algorithm for finding linear interval graph patterns
Yamasaki, Hitoshi
Shoudai, Takayoshi
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 67 - +
[12] A parallel algorithm for finding all hinge vertices of an interval graph
Honma, H
Masuyama, S
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (03) : 419 - 423
[13] A parallel algorithm for finding all hinge vertices of an interval graph
Honma, H., 2001, Institute of Electronics, Information and Communication, Engineers, IEICE (E84-D)
[14] Finding a domatic partition of an interval graph in time O(n)
Manacher, GK
Mankus, TA
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 167 - 172
[15] A PARALLEL ALGORITHM FOR FINDING A MAXIMUM WEIGHT CLIQUE OF AN INTERVAL GRAPH
SHYU, CH
PARALLEL COMPUTING, 1990, 13 (02) : 253 - 256
[16] Solving Minimum Connected Dominating Set on Proper Interval Graph
Tian, Jinqin
Ding, Hongsheng
2013 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 1, 2013, : 73 - 76
[17] FINDING ALL MINIMUM-SIZE SEPARATING VERTEX SETS IN A GRAPH
KANEVSKY, A
NETWORKS, 1993, 23 (06) : 533 - 541
[18] Faster algorithms for finding a minimum k-way cut in a weighted graph
Kamidoi, Y
Wakabayashi, S
Yoshida, N
ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1009 - 1012
[19] Parallel algorithm for finding the minimum edges to build a strongly connected directed graph
Tada, Akio
Mukai, Eiichi
Migita, Masahiro
Itokawa, Tsuyoshi
APPLIED MATHEMATICS FOR SCIENCE AND ENGINEERING, 2007, : 100 - +
[20] On finding the largest minimum distance of locally recoverable codes: A graph theory approach
Khabbazian, Majid
Medard, Muriel
DISCRETE MATHEMATICS, 2025, 348 (02)

← 1 2 3 4 5 →