Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
376
search results - page 76 / 76
»
Betweenness Centrality : Algorithms and Lower Bounds
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
ICALP
2011
Springer
233
views
Programming Languages
»
more
ICALP 2011
»
Improved Approximation for the Directed Spanner Problem
12 years 11 months ago
Download
www.cse.psu.edu
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
claim paper
Read More »
« Prev
« First
page 76 / 76
Last »
Next »