Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
โ Scribed by Antonio Puricella; Iain A. Stewart
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 566 KB
- Volume
- 290
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
โฆ Synopsis
Let H be a รฟxed undirected graph. An H -colouring of an undirected graph G is a homomorphism from G to H . If the vertices of G are partially ordered then there is a generic non-deterministic greedy algorithm which computes all lexicographically รฟrst maximal Hcolourable subgraphs of G. We show that the complexity of deciding whether a given vertex of G is in a lexicographically รฟrst maximal H -colourable subgraph of G is NP-complete, if H is bipartite, and p 2 -complete, if H is non-bipartite. This result complements Hell and Neร setร ril's seminal dichotomy result that the standard H -colouring problem is in P, if H is bipartite, and NP-complete, if H is non-bipartite. Our proofs use the basic techniques established by Hell and Neร setร ril, combinatorially adapted to our scenario.
๐ SIMILAR VOLUMES
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.
## Abstract A novel asymmetric monosubstituted 1,10โphenanthroline, Hophenโ 0.5โH~2~O (1, Hophen=1__H__โ[1,10]phenanthrolinโ2โone), was generated by a facile route, and a novel class of crystalline, d^10^โmetal, monomeric or oligomeric complexes of this ligand, namely [Hg(ophen)~2~]โ 4โH~2~Oโ CH~2~Cl~