f-Sensitivity Distance Oracles and Routing Schemes

An f-sensitivity distance oracle for a weighted undirected graph G ( V , E ) is a data structure capable of answering restricted distance queries between vertex pairs, i.e., calculating distances on a subgraph avoiding some forbidden edges. This paper presents an efficiently constructible f -sensiti...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 63; číslo 4; s. 861 - 882
Hlavní autoři:	Chechik, Shiri, Langberg, Michael, Peleg, David, Roditty, Liam
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.08.2012 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Computer systems performance. Reliability Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Information systems. Data bases Mathematics of Computing Memory organisation. Data processing Software Theoretical computing Theory of Computation Stretch Sensitivity Routing scheme Fault-tolerance Forbidden edges Distance oracle Database query Routing Weighted graph Fault tolerance Spanning tree Optimal trajectory Subgraph Optimal path Oracle Data structure Non directed graph
ISSN:	0178-4617, 1432-0541
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!