Complexity of graph partition problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 464-472

  Feder, Tomas ^a   Hell, Pavol ^a   Klein, Sulamita ^a   Motwani, Rajeev ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

GRAPH PARTITION; SPLIT GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 0032624193     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301373     Document Type: Article

References (26)