Go to the corresponding Portal 
Khanna, Neelesh ; Baswana, Surender
pdfformat: 

@InProceedings{khanna_et_al:LIPIcs:2010:2481, author = {Neelesh Khanna and Surender Baswana}, title = {{Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {513524}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897163}, ISSN = {18688969}, year = {2010}, volume = {5}, editor = {JeanYves Marion and Thomas Schwentick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2481}, URN = {urn:nbn:de:0030drops24812}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2481}, annote = {Keywords: Shortest path, distance, distance queries, oracle} }
Keywords:  Shortest path, distance, distance queries, oracle  
Seminar:  27th International Symposium on Theoretical Aspects of Computer Science  
Issue Date:  2010  
Date of publication:  09.03.2010 