Search Sciweavers | Sciweavers

213 search results - page 5 / 43

» Maintaining Minimum Spanning Trees in Dynamic Graphs

click to vote

FOCS
1998
IEEE

122views Theoretical Computer Science» more FOCS 1998»

Parametric and Kinetic Minimum Spanning Trees

14 years 5 days ago

Download www.ics.uci.edu

We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...

Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...

claim paper

Read More »

click to vote

OPODIS
2001

101views Distributed And Parallel Com...» more OPODIS 2001»

A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree

13 years 9 months ago

Download hal.archives-ouvertes.fr

In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...

Lélia Blin, Franck Butelle

claim paper

Read More »

click to vote

EGH
2009
Springer

143views Computer Graphics» more EGH 2009»

Fast minimum spanning tree for large graphs on the GPU

13 years 5 months ago

Download cvit.iiit.ac.in

Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...

Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....

claim paper

Read More »

click to vote

WINE
2009
Springer

83views Economy» more WINE 2009»

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

14 years 2 months ago

Download www.wisdom.weizmann.ac.il

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...

claim paper

Read More »