SOME PARALLEL ALGORITHMS ON INTERVAL-GRAPHS

被引：26

作者：

BERTOSSI, AA

BONUCCELLI, MA

机构：

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 16卷 / 02期

关键词：

D O I：

10.1016/0166-218X(87)90068-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：101 / 111

页数：11

共 16 条

[1]

[Anonymous], 1976, DISCRETE MATH MODELS

[2]

AWERBUCH B, 1984, 16TH P ANN ACM S THE, P249

[3] FINDING HAMILTONIAN CIRCUITS IN PROPER INTERVAL-GRAPHS [J].

BERTOSSI, AA .

INFORMATION PROCESSING LETTERS, 1983, 17 (02) :97-101

[4] DOMINATING SETS IN CHORDAL GRAPHS [J].

BOOTH, KS ;

JOHNSON, JH .

SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :191-199

[5]

DEKEL E, 1983, IEEE T COMPUT, V32, P307, DOI 10.1109/TC.1983.1676223

[6] PARALLEL MATRIX AND GRAPH ALGORITHMS [J].

DEKEL, E ;

NASSIMI, D ;

SAHNI, S .

SIAM JOURNAL ON COMPUTING, 1981, 10 (04) :657-675

[7] PARALLEL SCHEDULING ALGORITHMS [J].

DEKEL, E ;

SAHNI, S .

OPERATIONS RESEARCH, 1983, 31 (01) :24-49

[8]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

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

GUPTA, UI ;

LEE, DT ;

LEUNG, JYT .

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

[10]

KARP RM, 1984, 16TH P ANN ACM S THE, P266

← 1 2 →