Connecting face hitting sets in planar graphs (Q1944026): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the minimum corridor connection problem and other generalized geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Algorithms for Connected Feedback Vertex Set / rank
 
Normal rank

Revision as of 07:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Connecting face hitting sets in planar graphs
scientific article

    Statements

    Identifiers