491 search results - page 23 / 99 » On cyclically orientable graphs |
COMBINATORICS
2002
13 years 8 months ago
2002
If G = Kn is the complete graph, the classical Pr
LICS
2010
IEEE
13 years 6 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 ...
SODA
2012
ACM
11 years 11 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,...
ICCD
1995
IEEE
14 years 52 min 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...
CG
2008
Springer
13 years 10 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...