Short and Simple Cycle Separators in Planar Graphs (Q5266605): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4707791 / 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: Eigenvalue bounds, spectral partitioning, and metrical deformations via flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many distances in planar 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: Q3936211 / 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: Planar graphs, negative weight edges, shortest paths, and near linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short and Simple Cycle Separators in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar separators and parallel polygon triangulation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering planar separator algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for min cut and max flow in undirected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured recursive separator decompositions for planar graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs / 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: Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to find a separator in a graph excluding a minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Separable and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications / rank
 
Normal rank

Latest revision as of 00:34, 14 July 2024

scientific article; zbMATH DE number 6732191
Language Label Description Also known as
English
Short and Simple Cycle Separators in Planar Graphs
scientific article; zbMATH DE number 6732191

    Statements

    Short and Simple Cycle Separators in Planar Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    design
    0 references
    algorithms
    0 references
    cycle separator
    0 references
    performance
    0 references
    planar graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references