2487 search results - page 128 / 498 » Partitions of Graphs into Trees |
111
click to vote
WADS
2001
Springer
15 years 7 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 ...
108
Voted
ICFP
2008
ACM
16 years 3 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...
126
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
127
Voted
SC
2005
ACM
15 years 9 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
116
Voted
PODS
2002
ACM
16 years 3 months ago
2002
ACM