scientific article; zbMATH DE number 434872
zbMATH Open0786.05077MaRDI QIDQ3139724FDOQ3139724
Authors: James Abello, Hua Lin, Sekhar Pisupati 
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
algorithmmaximum cliqueHamiltonian cycleconnectivityvisibility graphsmaximally planarGhosh's conjecture
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)
Cited In (28)
- A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
- Visibility Graphs of Anchor Polygons
- A necessary condition for a graph to be the visibility graph of a simple polygon
- A new necessary condition for the vertex visibility graphs of simple polygons
- Negative results on characterizing visibility graphs
- Vertical visibility among parallel polygons in three dimensions
- 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
- Title not available (Why is that?)
- Simple Characterization of LR-visibility Polygons
- Weak visibility counting in simple polygons
- Computing the maximum clique in the visibility graph of a simple polygon
- Title not available (Why is that?)
- New Results on Visibility in Simple Polygons
- Ortho-polygon visibility representations of 3-connected 1-plane graphs
- The VC-Dimension of Visibility on the Boundary of a Simple Polygon
- Visibility properties and forbidden holes in graphs
- Characterizing LR-visibility polygons and related problems
- Disproving a conjecture on planar visibility graphs
- Title not available (Why is that?)
- An optimal visibility graph algorithm for triangulated simple polygons
- On representing a simple polygon perceivable to a blind person
- A P-Completeness Result for Visibility Graphs of Simple Polygons
- On recognizing and characterizing visibility graphs of simple polygons
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
- Visible shorelines containing at least \(k\) vertices
- Visibility of disjoint polygons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139724)
