Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy.
type: Item
instance of: scholarly article
title: Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy.
zbMATH Open document ID: 1044.68163
DOI: 10.1016/S0304-3975(02)00329-8
author: Antonio Puricella
author: Iain Stewart
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1965240
zbMATH Keywords: \(H\)-colourable subgraphs
MaRDI profile type: Publication
cites work: Q3941433
cites work: Q4779153
cites work: Q4521549
cites work: List homomorphisms to reflexive graphs
cites work: List homomorphisms and circular arc graphs
cites work: On the complexity of H-coloring
cites work: On generating all maximal independent sets
cites work: The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
cites work: \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
cites work: Q3221403
cites work: Q4448769
cites work: Complete Problems Involving Boolean Labelled Structures and Projection Transactions
full work available at URL: s0304-3975(02)00329-8
OpenAlex ID: W1972363616
description: scientific article; zbMATH DE number 1965240