Visibility graphs of towers
From MaRDI portal
Publication:676570
DOI10.1016/0925-7721(95)00033-XzbMATH Open0869.68112MaRDI QIDQ676570FDOQ676570
Authors: Paul Colley, Anna Lubiw, Jeremy P. Spinrad 
Publication date: 18 March 1997
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bipartite permutation graphs
- COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
- On recognizing and characterizing visibility graphs of simple polygons
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- DISTANCE VISIBILITY GRAPHS
- Recognizing visibility graphs of spiral polygons
- Title not available (Why is that?)
- COMPUTATIONAL GEOMETRY COLUMN 18
Cited In (6)
- Visibility Graphs of Anchor Polygons
- Visibility graphs of anchor polygons
- Computing the maximum clique in the visibility graph of a simple polygon
- A fast shortest path algorithm on terrain-like graphs
- DISTANCE VISIBILITY GRAPHS
- 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)
