Sciweavers

649 search results - page 49 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
CIVR
2005
Springer
14 years 2 months ago
EMD-Based Video Clip Retrieval by Many-to-Many Matching
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
Yuxin Peng, Chong-Wah Ngo
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 9 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
ATMOS
2009
130views Optimization» more  ATMOS 2009»
13 years 10 months ago
Arc-Flags in Dynamic Graphs
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 6 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
14 years 2 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...