491 search results - page 21 / 99 » On cyclically orientable graphs |
JCT
2010
13 years 6 months ago
2010
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
DM
1999
13 years 8 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
GC
2002
Springer
13 years 8 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
IWPC
2002
IEEE
14 years 1 months ago
2002
IEEE
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we pr...