Connectivity labeling in faulty colored graphs

Cites work

scientific article; zbMATH DE number 871898 (Why is no real title available?)
scientific article; zbMATH DE number 7788596 (Why is no real title available?)
A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
An optimal dual fault tolerant reachability oracle
Approximation algorithms for combinatorial problems
Approximation and hardness results for label cut and related problems
Color fault-tolerant spanners
Communication Complexity
Compact Forbidden-Set Routing
Connectivity check in 3-connected planar graphs with obstacles
Design and implementation of an efficient priority queue
Deterministic Fault-Tolerant Connectivity Labeling Scheme
Distance oracles for vertex-labeled graphs
Distributed constructions of dual-failure fault-tolerant distance preservers
Dual failure resilient BFS structure
Dual-failure distance and connectivity oracles
Efficient dynamic approximate distance oracles for vertex-labeled planar graphs
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
Fault-Tolerant Labeling and Compact Routing Schemes
Forbidden-set distance labels for graphs of bounded doubling dimension
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
Improved distance oracles and spanners for vertex-labeled graphs
Log-logarithmic worst-case range queries are possible in space theta(N)
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
Minimum\(+1\) \((s,t)\)-cuts and dual edge sensitivity oracle
Multiple source dual fault tolerant BFS trees
On randomized one-round communication complexity
On the diameter of Cayley graphs of the symmetric group
On the ratio of optimal integral and fractional covers
Preserving distances in very faulty graphs
Random contractions and sampling for hypergraph and hedge connectivity
Small-diameter Cayley graphs for finite simple groups
Sparse fault-tolerant BFS trees
Succinct data structures for nearest colored node in a tree
The nearest colored node in a tree
The one-way communication complexity of Hamming distance
Universally-optimal distributed algorithms for known topologies

This page was built for publication: Connectivity labeling in faulty colored graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7256138)