1545 search results - page 58 / 309 » On tree congestion of graphs |
IPL
2010
14 years 8 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
ICFP
2008
ACM
15 years 9 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...
PODS
2002
ACM
15 years 10 months ago
2002
ACM
STACS
2010
Springer
15 years 4 months ago
2010
Springer
