Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings > Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph

Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings |
Springer Berlin Heidelberg
Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings

Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
Authors

ARI Id

1674219721881_2943290

Access

Open/Free Access

Pages

13-24

DOI

10.1007/978-3-642-23719-5_2

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-23719-5_2

Loading...
Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...

Similar News

Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...