Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Neiman, Ofer Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 1 of 1 reviews    
  Space-efficient path-reporting approximate distance oracles
Elkin M., Neiman O., Wulff-Nilsen C. Theoretical Computer Science 651(C): 1-10, 2016.  Type: Article

Graph spanners are sparse subgraphs that preserve distances between nodes of the original graph to an approximation that is bounded, usually given in the form of a multiplication factor known as stretch. Such spanners have application ...
...
Feb 10 2017  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy