MINIMUM NODE DISJOINT PATH COVERING FOR CIRCULAR-ARC GRAPHS

被引：27

作者：

BONUCCELLI, MA

BOVET, DP

机构：

[1] Instituto di Scienze dell'Informazione, Università di Pisa

来源：

INFORMATION PROCESSING LETTERS | 1979年 / 8卷 / 04期

关键词：

Circular-arc graphs; node disjoint path cover; time complexity;

D O I：

10.1016/0020-0190(79)90011-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：159 / 161

页数：3

共 5 条

[1]

Berge, Graphs and Hypergraphs, (1976)

[2]

Boesch, Gimpel, Covering the points of a digraph with point-disjoint paths and its application to code optimization, Journal of the ACM, 24, 2, pp. 192-198, (1977)

[3]

Fredman, Weide, On the complexity of computing the measure of∪[a<sub>i</sub>, b<sub>i</sub>], Comm. ACM, 21, 7, pp. 540-544, (1978)

[4]

Gavril, Algorithms on circular-arc graphs, Networks, 4, pp. 357-369, (1974)

[5]

Weide, A survey of analysis techniques for discrete algorithms, ACM Computing Surveys, 9, 4, pp. 291-313, (1977)

← 1 →