Pages that link to "Item:Q5897569"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897569):
Displaying 11 items.
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
