scientific article; zbMATH DE number 2044949
From MaRDI portal
Publication:4448769
zbMath1042.68644MaRDI QIDQ4448769
Antonio Puricella, Iain A. Stewart
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040306.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Dichotomies for classes of homomorphism problems involving unary functions ⋮ Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. ⋮ Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties