Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897548
DOI10.1007/11604686zbMath1171.05389MaRDI QIDQ5897548
Sheng-Lung Peng, Mathieu Liedloff, Ji Ping Liu, Ton Kloks
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Improved integer linear programming formulation for weak Roman domination problem ⋮ Roman \(k\)-domination: hardness, approximation and parameterized results ⋮ Approximation algorithm for a generalized Roman domination problem in unit ball graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Upper bounds on Roman domination numbers of graphs ⋮ Nearly tight approximation algorithm for (connected) Roman dominating set
This page was built for publication: Graph-Theoretic Concepts in Computer Science
