Pages that link to "Item:Q5896939"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896939):
Displaying 15 items.
- The MST of symmetric disk graphs is light (Q425622) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Unit disk graphs (Q1174134) (← links)
- Disk/band surfaces of spatial graphs (Q1365383) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- A new characterization of disk graphs and its application. (Q2829061) (← links)
- Counting disk graphs (Q2857418) (← links)
- Edge estimation with independent set oracles (Q4993304) (← links)
- (Q5115779) (← links)
- Computing a maximum clique in geometric superclasses of disk graphs (Q5918528) (← links)
- Representing graphs by disks and balls (a survey of recognition-complexity results) (Q5931448) (← links)
- Sunflower hard disk graphs (Q6061033) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)