Structural Information and Communication Complexity

DOI10.1007/b98251zbMath1085.68104MaRDI QIDQ5315241

Miroslav Chlebík, Janka Chlebíková

Publication date: 7 September 2005

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

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms

Related Items

Complexity of approximating bounded variants of optimization problems, Packing triangles in low degree graphs and indifference graphs, Recoverable Values for Independent Sets