Recognition and complexity of point visibility graphs (Q512262): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1503.07082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility graphs and oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality theorems for inscribed polytopes and Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing and characterizing visibility graphs of simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in visibility graphs of points, segments, and polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on point visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Intrinsic Spread of a Configuration in R d / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality theorems for configuration spaces of planar linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of the visibility graph of a set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple realizability of complete abstract topological graphs in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer realizations of disk and segment graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On visibility and blockers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point Visibility Graph Recognition is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Geometric and Topological Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-stretchable pseudo-visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of Diophantine problems in combinatorial geometry / rank
 
Normal rank

Latest revision as of 12:06, 13 July 2024

scientific article
Language Label Description Also known as
English
Recognition and complexity of point visibility graphs
scientific article

    Statements

    Recognition and complexity of point visibility graphs (English)
    0 references
    0 references
    0 references
    24 February 2017
    0 references
    0 references
    point visibility graphs
    0 references
    existential theory of the reals
    0 references
    geometric graph representations
    0 references
    0 references
    0 references