Q5009573 (Q5009573): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Amplification for Pairwise Spanner Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 4/3 Additive Spanner Exponent Is Tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Lower Bounds for Sublinear Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Distance Labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler, faster and shorter labels for distances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representations of Separable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Size Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Distance Preservers and Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Distance Preservers and Additive Spanners / 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: Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many distances in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs / 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: Computing the Girth of a Planar Graph in Linear Time / 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: Q2768340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Sourcewise and Pairwise Distance Preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-Stretch Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs / 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: Planar graphs, negative weight edges, shortest paths, and near linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear-space distance labeling using hubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Sparsification in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified compression-based acceleration of edit-distance computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116490 / 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: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear Time Algorithm for Generalized Matrix Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in directed planar graphs with negative lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short path queries in planar graphs in constant time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Terminal Distances Using Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal <i>n</i>-universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners and emulators with sublinear distance errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:49, 26 July 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    planar graphs
    0 references
    shortest paths
    0 references
    metric compression
    0 references
    distance preservers
    0 references
    distance emulators
    0 references
    distance oracles
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers