Graph separators: A parameterized view (Q1877710): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2721971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exact algorithms for hard problems: A parameterized point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Independent Sets in Map Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Partitioning Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced constants for simple cycle graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the planar separator theorem to counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Revision as of 20:09, 6 June 2024

scientific article
Language Label Description Also known as
English
Graph separators: A parameterized view
scientific article

    Statements

    Graph separators: A parameterized view (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Planar graph problems
    0 references
    Fixed parameter tractability
    0 references
    Parameterized complexity
    0 references
    Graph separator theorems
    0 references
    Divide-and-conquer algorithms
    0 references