Sciweavers

482 search results - page 5 / 97
» A Linear-Time Graph Kernel
Sort
View
OPODIS
2001
14 years 8 days ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
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
ACIVS
2006
Springer
14 years 4 months ago
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
Alexandre X. Falcão, Paulo A. V. Miranda, A...
DAM
2010
54views more  DAM 2010»
13 years 11 months ago
An implicit representation of chordal comparability graphs in linear time
Andrew R. Curtis, Clemente Izurieta, Benson L. Joe...