618 search results - page 55 / 124 » Short cycle connectivity |
136
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...
188
Voted
STRINGOLOGY
2008
15 years 5 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
156
Voted
VMV
2001
15 years 5 months ago
2001
Closed streamlines are a missing part in most visualizations of vector field topology. In this paper, we propose a method which detects closed streamlines in a time-dependent two-...
162
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a new approach to the analysis of Loopy Belief Propagation (LBP) by establishing a formula that connects the Hessian of the Bethe free energy with the edge zeta functio...
118
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...