549 search results - page 27 / 110 » The corner arc algorithm |
137
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
119
click to vote
FLAIRS
2009
15 years 5 days ago
2009
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messag...
ARCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
108
Voted
DAM
2006
15 years 2 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
111
click to vote
WG
2010
Springer
15 years 7 days ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...