<--- Back to Details
First PageDocument Content
Graph coloring / Minimum spanning tree / Minor / Shortest path problem / Graph / Path decomposition / Line graph / Graph theory / Mathematics / Planar graphs
Date: 2004-09-09 03:25:47
Graph coloring
Minimum spanning tree
Minor
Shortest path problem
Graph
Path decomposition
Line graph
Graph theory
Mathematics
Planar graphs

Add to Reading List

Source URL: www.emis.de

Download Document from Source Website

File Size: 95,81 KB

Share Document on Facebook

Similar Documents

Lecture 6 Minimum Spanning Trees In this lecture, we study another classic graph problem from the distributed point of view: minimum spanning tree construction. Definition 6.1 (Minimum Spanning Tree (MST)). Given a simp

DocID: 1v5jY - View Document

Algorithms and Data Structures Winter TermExercises for UnitConsider the Jarnik-Prim algorithm for computing a minimum spanning tree. Convince yourself that it can be implemented with Fibonacci heaps to r

DocID: 1sqEk - View Document

Graph theory / Mathematics / Search algorithms / Spanning tree / Computer programming / Routing algorithms / Combinatorial optimization / Edsger W. Dijkstra / Pointer jumping / Minimum spanning tree / Tree / Depth-first search

Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

DocID: 1rqFm - View Document

Abstract data types / Mathematics / Software engineering / Computer programming / Analysis of algorithms / Asymptotic analysis / Binary trees / Binomial heap / Priority queue / Minimum spanning tree / Big O notation / Heap

Programming Techniques S.L. Graham, R.L. Rivest Editors

DocID: 1rm4m - View Document

Graph theory / Mathematics / Computational complexity theory / Edsger W. Dijkstra / Network theory / Shortest path problem / Minimum spanning tree / Network flow / Dynamic programming

LNCSEfficient Dynamic Aggregation

DocID: 1rjoH - View Document