Online dominating set and coloring
From MaRDI portal
Publication:6606165
DOI10.1007/978-3-031-49611-0_5MaRDI QIDQ6606165
Sambhav Khurana, Minati De, Satyam Singh
Publication date: 16 September 2024
dominating setcoloringconnected dominating set\(t\)-relaxed coloring\( \alpha \)-fat objectsindependent kissing number
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On-line algorithms for the dominating set problem
- On connected domination in unit ball graphs
- A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
- Bounded families for the on-line \(t\)-relaxed coloring
- Unit disk graphs
- On coloring unit disk graphs
- Online dominating set
- On-line coloring of geometric intersection graphs
- Tight bounds for online coloring of basic graph classes
- Das Problem der dreizehn Kugeln
- Research Problems in Discrete Geometry
- Simple heuristics for unit disk graphs
- Independence and Coloring Problems on Intersection Graphs of Disks
- Relaxing the irrevocability requirement for online graph algorithms
- Online unit covering in Euclidean space
- Geometric dominating-set and set-cover via local-search
This page was built for publication: Online dominating set and coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606165)
