Minimum dominating sets of intervals on lines

DOI10.1007/bfb0030873zbMath1527.68157OpenAlexW1509957164MaRDI QIDQ6064049

Shmuel Zaks, Michael Kaminski, Siu-Wing Cheng

Publication date: 12 December 2023

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

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

zbMATH Keywords

interval graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• A unified approach to domination problems on interval graphs
• Priority Search Trees
• Total Domination and Irredundance in Weighted Interval Graphs
• Dominating Sets in Chordal Graphs

This page was built for publication: Minimum dominating sets of intervals on lines