Q5111733 (Q5111733): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1370851
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Monika R. Henzinger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards (1 + <i>∊</i>)-Approximate Flow Sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Size Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Lower Bound for the Steiner Point Removal Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding k-Outerplanar Graphs into l1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Paths in Planar Graphs with Constant Congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex sparsifiers with Steiner nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in undirected graphs with constant congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sourcewise and Pairwise Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular planar graphs and resistor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Plane Transitive Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5351905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Sparsifiers: New Results from Old Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Sparsification in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing multiterminal flow networks and computing flows in networks of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting Corners Cheaply, or How to Remove Steiner Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mimicking networks representing minimum terminal cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Terminal Distances Using Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mimicking Networks and Succinct Representations of Terminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined Vertex Sparsifiers of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A node-capacitated Okamura-Seymour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions and limits to vertex sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric extension operators, vertex sparsifiers and Lipschitz extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distortion required for embedding finite metric spaces into normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Sparsification of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank

Latest revision as of 19:30, 22 July 2024

scientific article; zbMATH DE number 7205022
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7205022

    Statements

    0 references
    0 references
    0 references
    27 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex sparsification
    0 references
    graph sparsification
    0 references
    planar graphs
    0 references
    metric embedding
    0 references
    reachability
    0 references
    0 references
    0 references
    0 references
    0 references