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...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 63; no. 4; pp. 861 - 882
Main Authors:	Chechik, Shiri, Langberg, Michael, Peleg, David, Roditty, Liam
Format:	Journal Article Conference Proceeding
Language:	English
Published:	New York Springer-Verlag 01.08.2012 Springer
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!