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 条

HUBERT, L .

[12]

Lekkerkerker C. G., 1962, FUND MATH, V51, P45, DOI DOI 10.4064/FM-51-1-45-64

[13] LINEAR TIME ALGORITHM FOR DECIDING INTERVAL GRAPH ISOMORPHISM [J].

LUEKER, GS ;

BOOTH, KS .

[14] ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHS [J].

MINTY, GJ .

[15]

Rose D. J., 1976, SIAM Journal on Computing, V5, P266, DOI 10.1137/0205021

[16]

Rose D. J., 1970, Journal of Mathematical Analysis and Applications, V32, P597, DOI 10.1016/0022-247X(70)90282-9

[17]

Rose D. J., 1973, GRAPH THEORY COMPUTI, P183

[18] CIRCULAR GENETIC MAPS [J].

STAHL, FW .

[19] SCHEDULING OF TRAFFIC LIGHTS - A NEW APPROACH [J].

STOFFERS, KE .

TRANSPORTATION RESEARCH, 1968, 2 (03) :199-&

TROTTER, WT ;

MOORE, JI .