491 search results - page 23 / 99 » On cyclically orientable graphs |
115
click to vote
COMBINATORICS
2002
15 years 2 months ago
2002
If G = Kn is the complete graph, the classical Pr
112
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
134
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
127
click to vote
ICCD
1995
IEEE
15 years 6 months ago
1995
IEEE
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...
132
click to vote
CG
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...