601 search results - page 50 / 121 » Edge-dominating cycles in graphs |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
ICTAI
2006
IEEE
14 years 2 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
CPC
2006
13 years 8 months ago
2006
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
PDCAT
2004
Springer
14 years 2 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
JCB
2006
13 years 8 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...