184 search results - page 1 / 37 » A Gessel-Viennot-Type Method for Cycle Systems in a Directed... |
COMBINATORICS
2006
13 years 4 months ago
2006
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
PDP
2007
IEEE
13 years 10 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
IPL
2002
13 years 4 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...