Pages that link to "Item:Q5450806"
From MaRDI portal
The following pages link to Independence and Coloring Problems on Intersection Graphs of Disks (Q5450806):
Displaying 9 items.
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- Generalized disk graphs (Q832849) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Facility location with tree topology and radial distance constraints (Q2280295) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- Online dominating set and coloring (Q6606165) (← links)
