Oracles for Distances Avoiding a Failed Node or Link

We consider the problem of preprocessing an edge-weighted directed graph $G$ to answer queries that ask for the length and first hop of a shortest path from any given vertex $x$ to any given vertex $y$ avoiding any given vertex or edge. As a natural application, this problem models routing in networ...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 37; číslo 5; s. 1299 - 1318
Hlavní autoři:	Demetrescu, Camil, Thorup, Mikkel, Chowdhury, Rezaul Alam, Ramachandran, Vijaya
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2008
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology Failure Graph theory Graphs Information retrieval. Graph Mathematics Miscellaneous Queries Sciences and techniques of general use Theoretical computing 68P05 Vertex Query 68W01 Node 90B18 Network data structures Oracle Distance Failure graph algorithms Edge(graph) Construction network failures; 05C85 Shortest path Algorithm Failures Weighted graph shortest paths Network routing Digraph Application Directed graph Link 05C38
ISSN:	0097-5397, 1095-7111
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!