The complexity of comparability graph recognition and coloring

Abstract

Using the notion ofG-decomposition introduced in Golumbic [8, 9], we present an implementation of an algorithm which assigns a transitive orientation to a comparability graph inO(δ·|E|) time andO(|E|) space where δ is the maximum degree of a vertex and |E| is the number of edges. A quotient operation reducing the graph in question and preservingG… (More)
DOI: 10.1007/BF02253207

Topics

2 Figures and Tables

Cite this paper

@article{Golumbic1977TheCO, title={The complexity of comparability graph recognition and coloring}, author={Martin Charles Golumbic}, journal={Computing}, year={1977}, volume={18}, pages={199-208} }