Edge intersection graphs of \(L\)-shaped paths in grids (Q299080): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some properties of edge intersection graphs of single-bend paths on a grid / 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: Approximation Algorithms for B 1-EPG Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge intersection graphs of single bend paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-intersection graphs of grid paths: the bend-number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank

Latest revision as of 04:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Edge intersection graphs of \(L\)-shaped paths in grids
scientific article

    Statements

    Edge intersection graphs of \(L\)-shaped paths in grids (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    edge intersection graphs
    0 references
    grid paths
    0 references
    split graphs
    0 references
    NP-completeness
    0 references
    recognition algorithms
    0 references
    \(L\)-graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references