Minimum dominating sets of intervals on lines

DOI10.1007/PL00009197MaRDI QIDQ1386338zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 24 May 1998

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

dominating setspriority search tree

Mathematics Subject Classification ID

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

Recommendations

• Minimum connected dominating sets of intervals on lines
• On minimum intersection of two minimum dominating sets of interval graphs
• Total domination in interval graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

Cited in

(8)

• Geometric dominating sets -- a minimum version of the no-three-in-line problem
• Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
• Efficient maintenance of the union of intervals on a line, with applications
• Minimum connected dominating sets of intervals on lines
• scientific article; zbMATH DE number 1354129 (Why is no real title available?)
• Maximizing dominance in the plane and its applications
• Maximizing dominance in the plane and its applications
• Minimum dominating sets of intervals on lines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386338)