scientific article; zbMATH DE number 7053272

zbMath1422.68044MaRDI QIDQ5743393

Utkarsh Lath, Anuradha S. Mehta, Surender Baswana

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095136

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Fault-tolerant distance labeling for planar graphs ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The k most vital arcs in the shortest path problem
• Finding the most vital node of a shortest path.
• A data structure for dynamic trees
• On the difficulty of some shortest path problems
• Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
• Fast Algorithms for Finding Nearest Common Ancestors
• Oracles for Distances Avoiding a Failed Node or Link
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• A Separator Theorem for Planar Graphs
• A nearly optimal oracle for avoiding failed vertices and edges
• Compact oracles for reachability and approximate distances in planar digraphs
• Automata, Languages and Programming

This page was built for publication: