Fault-tolerant distance labeling for planar graphs (Q5970814): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3132815657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Induced Universal Graphs and Adjacency Labeling for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal Adjacency Labeling Schemes for Power-Law Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency Labeling Schemes and Induced-Universal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal induced universal graphs for bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Labels by Traversal and Jumping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Schemes for Flow and Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Labeling for Node Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling schemes for vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Informative labeling schemes for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity-preserving labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better distance labeling for unweighted planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796196 / 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: Object location using path separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subjective-cost policy routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact labelings for efficient first-order model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained-path labellings on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear-time algorithm for computing replacement paths in planar directed graphs / 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: Q5417665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Distance Oracles for Planar Graphs with Failing Vertices / 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: Q2921664 / 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: Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091049 / 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: Structured recursive separator decompositions for planar graphs in linear time / 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: Multiple-Source Shortest Paths in Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal distance oracles for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture / rank
 
Normal rank

Latest revision as of 23:07, 28 July 2024

scientific article; zbMATH DE number 7524430
Language Label Description Also known as
English
Fault-tolerant distance labeling for planar graphs
scientific article; zbMATH DE number 7524430

    Statements

    Fault-tolerant distance labeling for planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2022
    0 references
    forbidden-set distance labels
    0 references
    planar graphs
    0 references
    fault-tolerant distance labels
    0 references
    counting shortest paths
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers