66 search results - page 8 / 14 » Cycles in dense digraphs |
149
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
139
Voted
ICDCS
2008
IEEE
15 years 10 months ago
2008
IEEE
— 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...
140
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
120
click to vote
DAM
1999
15 years 3 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
123
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...