Sciweavers

983 search results - page 17 / 197
» Negative-Weight Cycle Algorithms
Sort
View
ICDCS
2008
IEEE
15 years 6 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
14 years 11 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
ESA
2005
Springer
95views Algorithms» more  ESA 2005»
15 years 5 months ago
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
Sergio Cabello, Bojan Mohar
WEBI
2005
Springer
15 years 5 months ago
Detecting Sequences and Cycles of Web Pages
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...
B. Lakshmi Narayan, Sankar K. Pal
ICCV
2001
IEEE
16 years 1 months ago
Stereo Matching by Compact Windows via Minimum Ratio Cycle
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
Olga Veksler