Pathwidth, trees, and random embeddings (Q2439830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding k-Outerplanar Graphs into l1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Sparsest Cut in Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts, trees and \(\ell_1\)-embeddings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3602875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coarse differentiation and multi-flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of graphs with a forbidden minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the distortion of embedding finite metric spaces in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank

Revision as of 11:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Pathwidth, trees, and random embeddings
scientific article

    Statements

    Pathwidth, trees, and random embeddings (English)
    0 references
    0 references
    17 March 2014
    0 references
    shortest-path metric
    0 references
    random trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references