Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_46 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2403403088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Intersection Graphs of Paths on a Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: $1$-string $B_2$-VPG representation of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs have 1-string representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Posets and VPG graphs / 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: Equilateral L-Contact Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs as VPG-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Graphs of L-Shapes and Segments in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank

Latest revision as of 10:45, 11 July 2024

scientific article
Language Label Description Also known as
English
Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs
scientific article

    Statements

    Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references