Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4063153 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Bipartite permutation graphs
- COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
- COMPUTATIONAL GEOMETRY COLUMN 18
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- DISTANCE VISIBILITY GRAPHS
- On recognizing and characterizing visibility graphs of simple polygons
- Recognizing visibility graphs of spiral polygons
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
Cited in
(6)- Computing the maximum clique in the visibility graph of a simple polygon
- A fast shortest path algorithm on terrain-like graphs
- Visibility graphs of anchor polygons
- DISTANCE VISIBILITY GRAPHS
- Visibility Graphs of Anchor Polygons
- Linear-time algorithms for counting independent sets in bipartite permutation graphs
This page was built for publication: Visibility graphs of towers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676570)