Sciweavers

Share
184 search results - page 1 / 37
» A Gessel-Viennot-Type Method for Cycle Systems in a Directed...
Sort
View
COMPGEOM
2010
ACM
10 years 7 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
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...
Sergio Cabello, Éric Colin de Verdiè...
FCT
2009
Springer
10 years 9 months ago
Directed Graphs of Entanglement Two
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...
Erich Grädel, Lukasz Kaiser, Roman Rabinovich
PDP
2007
IEEE
10 years 9 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
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...
Andreas Beckmann, Jorg Keller
IPL
2002
95views more  IPL 2002»
10 years 2 months ago
On a game in directed graphs
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)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
books