Pages that link to "Item:Q5419182"
From MaRDI portal
The following pages link to Unsolved problems in visibility graphs of points, segments, and polygons (Q5419182):
Displaying 14 items.
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- A fast shortest path algorithm on terrain-like graphs (Q2046450) (← links)
- On colouring point visibility graphs (Q2201772) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- Grid obstacle representation of graphs (Q2663991) (← links)
- A Characterization of Visibility Graphs for Pseudo-polygons (Q3452822) (← links)
- Obstacle Numbers of Planar Graphs (Q4625101) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- One-sided terrain guarding and chordal graphs (Q6204302) (← links)
