<--- Back to Details
First PageDocument Content
Spanning tree / Minimum spanning tree / Eulerian path / Biconnected component / Euler tour technique / Connected component / Matching / Uzi Vishkin / Graph coloring / Graph theory / Theoretical computer science / Mathematics
Date: 2010-12-09 11:09:54
Spanning tree
Minimum spanning tree
Eulerian path
Biconnected component
Euler tour technique
Connected component
Matching
Uzi Vishkin
Graph coloring
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: www.mpi-inf.mpg.de

Download Document from Source Website

File Size: 859,79 KB

Share Document on Facebook

Similar Documents

Computer programming / Mathematics / Software engineering / Graph connectivity / Connectivity / Tree traversal / Search algorithms / NP-complete problems / Biconnected component / HopcroftKarp algorithm

Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

DocID: 1qDjI - View Document

Graph theory / Mathematics / Graph connectivity / Network theory / NP-complete problems / Edsger W. Dijkstra / Shortest path problem / Graph / Path / Hamiltonian path / Distance / Biconnected component

Microsoft PowerPoint - Presentation2

DocID: 1qw1W - View Document

Graph theory / Mathematics / Spanning tree / Axiom of choice / Tree / Minimum spanning tree / Ear decomposition / Graph connectivity / NP-complete problems / Biconnected component / Vertex cover

Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

DocID: 1pVrn - View Document

Network theory / Computational geometry / Diagrams / Discrete geometry / Voronoi diagram / Pseudoforest / Connectivity / Biconnected component / Tree / Graph theory / Mathematics / Theoretical computer science

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Optimal Data Structures for Farthest-Point Queries in Cactus Networks∗ Prosenjit Bose† Jean-Lou De Carufel†

DocID: 186p2 - View Document

Graph drawing / Dual graph / Parallel Random Access Machine / Connectivity / Planarity testing / Biconnected component / Graph theory / Planar graphs / Topological graph theory

More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. Michael T. Goodrich, Joseph A. Simons Department of Computer Science, Univers

DocID: 1843S - View Document