FAST ALGORITHMS FOR GENERATING ALL MAXIMAL INDEPENDENT SETS OF INTERVAL, CIRCULAR-ARC AND CHORDAL GRAPHS

被引：31

作者：

LEUNG, JYT ^{[1
]}

机构：

[1] NORTHWESTERN UNIV, DEPT ELECT ENGN & COMP SCI, EVANSTON, IL 60201 USA

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1984年 / 5卷 / 01期

关键词：

D O I：

10.1016/0196-6774(84)90037-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：22 / 35

页数：14

共 25 条

[1]

[Anonymous], 1976, DISCRETE MATH MODELS

[2] ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE [J].

BENZER, S .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1959, 45 (11) :1607-1620

[3] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J].

BOOTH, KS ;

LUEKER, GS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) :335-379

[4]

Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]

[5] INCIDENCE MATRICES AND INTERVAL GRAPHS [J].

FULKERSON, DR ;

GROSS, OA .

PACIFIC JOURNAL OF MATHEMATICS, 1965, 15 (03) :835-+

[6]

GAREY MR, 1979, COMPLEXITY COLORING

[7]

Gavril F., 1972, SIAM Journal on Computing, V1, P180, DOI 10.1137/0201013

[8]

Gavril F., 1974, NETWORKS, V4, P357

[9] CHARACTERIZATION OF COMPARABILITY GRAPHS + OF INTERVAL GRAPHS [J].

GILMORE, PC ;

HOFFMAN, AJ .

CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (03) :539-&

[10] EFFICIENT ALGORITHMS FOR INTERVAL-GRAPHS AND CIRCULAR-ARC GRAPHS [J].

GUPTA, UI ;

LEE, DT ;

LEUNG, JYT .

NETWORKS, 1982, 12 (04) :459-467

← 1 2 3 →