Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982485164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid / rank
 
Normal rank
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: Edge intersection graphs of systems of paths on a grid with a bounded number of bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique coloring \(B_1\)-EPG graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3386616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Set on B1-EPG Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems in multiple-interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge intersection graphs of \(L\)-shaped paths in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of cographs as intersection graphs of paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On split \(B_1\)-EPG graphs / 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: VPG and EPG bend-numbers of Halin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper circular arc graphs as intersection graphs of paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> “edge intersection graphs of single bend paths on a grid” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5133652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-intersection graphs of boundary-generated paths in 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: On the bend-number of planar and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge intersection graphs of paths with 2 bends / rank
 
Normal rank

Latest revision as of 20:22, 22 July 2024

scientific article
Language Label Description Also known as
English
Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
scientific article

    Statements

    Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2020
    0 references
    0 references
    B1-EPG graphs
    0 references
    edge intersection graph
    0 references
    paths on a grid
    0 references
    fully-subdivided graphs
    0 references
    \(k\)-simplicial graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references