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
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
Chapter Info
Authors
ARI Id
1674219721881_2943290
Access
Open/Free Access
Pages
13-24
DOI
Chapter URL
Table of Contents of Book
Chapters/Headings | Author(s) | Pages | Info |
Loading... | |||
Chapters/Headings | Author(s) | Pages | Info |
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...
Similar News
Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...