Edge Disjoint Spanning Trees Dominators And Depth First Search
Download Edge Disjoint Spanning Trees Dominators And Depth First Search PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Edge Disjoint Spanning Trees Dominators And Depth First Search book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Edge-disjoint spanning trees, dominators, and depth- first search
This paper presents an algorithm for finding two edge-disjoint spanning trees rooted at a fixed vertex of a directed graph. The algorithm uses depth-first search, an efficient method for computing disjoint set unions, and an efficient method for computing dominators. It requires O(V log V+E) time and O(V+E) space to analyze a graph with V vertices and E edges. (Author).
Combinatorial Optimization
Author: Alexander Schrijver
language: en
Publisher: Springer Science & Business Media
Release Date: 2003-02-12
This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Experimental Algorithms
This book constitutes the refereed proceedings of the 13th International Symposium on Experimental Algorithms, SEA 2014, held in Copenhagen, Denmark, in June/July 2014. The 36 revised full papers presented together with 3 invited presentations were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on combinatorial optimization, data structures, graph drawing, shortest path, strings, graph algorithms and suffix structures.