On classes of graphs with strongly sublinear separators (Q1750205): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reduced constants for simple cycle graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear separators, fragility and subexponential expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Sublinear Separators and Polynomial Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small balanced separators / 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: 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: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order properties on nowhere dense structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank

Latest revision as of 16:25, 15 July 2024

scientific article
Language Label Description Also known as
English
On classes of graphs with strongly sublinear separators
scientific article

    Statements

    On classes of graphs with strongly sublinear separators (English)
    0 references
    0 references
    18 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate algorithm
    0 references
    balanced separator
    0 references
    0 references
    0 references