Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897569
DOI10.1007/11604686zbMath1171.68872MaRDI QIDQ5897569
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (12)
Faster approximation for maximum independent set on unit disk graph ⋮ Efficient independent set approximation in unit disk graphs ⋮ Optimization problems in dotted interval graphs ⋮ Cubicity and bandwidth ⋮ Two generalizations of proper coloring: hardness and approximability ⋮ Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem ⋮ On the recognition of unit disk graphs and the distance geometry problem with ranges ⋮ Connected dominating sets on dynamic geometric graphs ⋮ Structure of polynomial-time approximation ⋮ Minimum vertex cover in rectangle graphs ⋮ Improved Algorithm for Maximum Independent Set on Unit Disk Graph ⋮ On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
