The Computational Complexity of Disconnected Cut and 2K 2-Partition

First Author: Martin B
Attributed to:  Algorithmic Aspects of Graph Coloring funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-23786-7_43

Publication URI: http://dx.doi.org/10.1007/978-3-642-23786-7_43

Type: Book Chapter

Book Title: Principles and Practice of Constraint Programming - CP 2011 (2011)

Page Reference: 561-575

ISSN: 03029743 16113349