Complexity of graph partition problems

被引：0

|

作者：

Feder, Tomas

Hell, Pavol

Klein, Sulamita

Motwani, Rajeev

机构：

来源：

Conference Proceedings of the Annual ACM Symposium on Theory of Computing | 1999年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：464 / 472

相关论文

共 50 条

[1] On the complexity of graph tree partition problems
Cordone, R
Maffioli, F
DISCRETE APPLIED MATHEMATICS, 2004, 134 (1-3) : 51 - 65
[2] On the complexity of some partition problems
Andreeva, LN
Oranov, AM
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1997, 36 (02) : 269 - 271
[3] A note on the computational complexity of graph vertex partition
Huang, Yuanqiu
Chub, Yuming
DISCRETE APPLIED MATHEMATICS, 2007, 155 (03) : 405 - 409
[4] Complexity and approximation of Satisfactory Partition problems
Bazgan, C
Tuza, Z
Vanderpooten, D
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 829 - 838
[5] Graph partition problems into cycles and paths
Enomoto, H
DISCRETE MATHEMATICS, 2001, 233 (1-3) : 93 - 101
[6] COMPLEXITY OF GRAPH EMBEDDABILITY PROBLEMS
BENZAKEN, C
FOLDES, S
THEORETICAL COMPUTER SCIENCE, 1981, 15 (03) : 321 - 328
[7] THE PARALLEL COMPLEXITY OF COARSEST SET PARTITION PROBLEMS
SANG, C
HUYNH, DT
INFORMATION PROCESSING LETTERS, 1992, 42 (02) : 89 - 94
[8] ON COMPLEXITY OF SOME CHAIN AND ANTICHAIN PARTITION PROBLEMS
LONC, Z
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 97 - 104
[9] A LINEAR TIME ALGORITHM FOR GRAPH PARTITION PROBLEMS
CLARK, LH
SHAHROKHI, F
SZEKELY, LA
INFORMATION PROCESSING LETTERS, 1992, 42 (01) : 19 - 24
[10] RESTRICTIONS OF GRAPH PARTITION PROBLEMS .1.
BODLAENDER, HL
JANSEN, K
THEORETICAL COMPUTER SCIENCE, 1995, 148 (01) : 93 - 109

← 1 2 3 4 5 →