2487 search results - page 217 / 498 » Partitions of Graphs into Trees |
103
click to vote
IPL
2010
15 years 2 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
127
Voted
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
146
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
131
click to vote
SIROCCO
2004
15 years 5 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
114
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...