LATIN 2004: Theoretical Informatics

DOI10.1007/b95852zbMath1196.05060OpenAlexW2475444492MaRDI QIDQ5901630

Loana Tito Nogueira, Fábio Protti, Sulamita Klein, Pavol Hell, Tomás Feder

Publication date: 7 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95852

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

List matrix partitions of chordal graphs

This page was built for publication: LATIN 2004: Theoretical Informatics