Search Sciweavers | Sciweavers

4850 search results - page 10 / 970

» Approximate Data Structures with Applications

click to vote

STACS
2010
Springer

172views Theoretical Computer Science» more STACS 2010»

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs

14 years 1 months ago

Download drops.dagstuhl.de

Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...

Neelesh Khanna, Surender Baswana

claim paper

Read More »

click to vote

CORR
2010
Springer

135views Education» more CORR 2010»

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph

13 years 8 months ago

Download hal.inria.fr

Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...

Neelesh Khanna Surender Baswana

claim paper

Read More »

click to vote

CORR
2008
Springer

65views Education» more CORR 2008»

Succinct Data Structures for Retrieval and Approximate Membership

13 years 8 months ago

Download www.itu.dk

Martin Dietzfelbinger, Rasmus Pagh

claim paper

Read More »