Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902530
DOI10.1007/b93953zbMath1255.68082MaRDI QIDQ5902530
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Subgraph complementation ⋮ LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS ⋮ Computational complexity of covering three-vertex multigraphs ⋮ Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ On Switching to H‐Free Graphs ⋮ Unnamed Item ⋮ On Gromov's method of selecting heavily covered points ⋮ On the Hardness of Switching to a Small Number of Edges ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ Partial complementation of graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
