Finding geometric representations of apex graphs is NP-hard (Q2154093): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3153542555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Deque and Queue Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is the intersection graph of segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs have 1-string representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8--10, 2020, Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorable planar graphs have an intersection segment representation using 3 slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not all planar graphs are in PURE-4-DIR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homothetic triangle representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On grid intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Weighted Disk Contact Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Intersection Graphs: Do Short Cycles Help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of Thin Film RC Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and accurate algorithms for protein side-chain packing / rank
 
Normal rank

Latest revision as of 15:17, 29 July 2024

scientific article
Language Label Description Also known as
English
Finding geometric representations of apex graphs is NP-hard
scientific article

    Statements

    Finding geometric representations of apex graphs is NP-hard (English)
    0 references
    0 references
    0 references
    13 July 2022
    0 references
    Hamiltonian path
    0 references
    planar graph
    0 references
    apex graph
    0 references
    \( \mathsf{NP} \)-hard
    0 references
    recognition problem
    0 references
    geometric intersection graph
    0 references
    VLSI design
    0 references
    1-STRING
    0 references
    PURE-2-DIR
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers