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žené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 63; číslo 4; s. 861 - 882
Hlavní autori:	Chechik, Shiri, Langberg, Michael, Peleg, David, Roditty, Liam
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.08.2012 Springer
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!