FINDING HAMILTONIAN CIRCUITS IN PROPER INTERVAL-GRAPHS

被引：52

作者：

BERTOSSI, AA

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(83)90078-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：97 / 101

页数：5

共 17 条

[1]

[Anonymous], 1976, DISCRETE MATH MODELS

[2] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE [J].

BERTOSSI, AA .

[3] MINIMUM NODE DISJOINT PATH COVERING FOR CIRCULAR-ARC GRAPHS [J].

BONUCCELLI, MA ;

BOVET, DP .

BOOTH, KS ;

LUEKER, GS .

[5] COMPLEXITY OF COMPUTING MEASURE OF U[AI, BI] [J].

FREDMAN, ML ;

WEIDE, B .

[6]

Garey M. R., 1976, SIAM Journal on Computing, V5, P704, DOI 10.1137/0205049

[7]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[8]

Gavril F., 1974, NETWORKS, V4, P357

[9]

Gavril F., 1973, NETWORKS, V3, P261, DOI DOI 10.1002/NET.3230030305

[10]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH