2487 search results - page 212 / 498 » Partitions of Graphs into Trees |
120
click to vote
VLDB
1999
ACM
15 years 8 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
121
click to vote
ESANN
2007
15 years 5 months ago
2007
We present a generative probabilistic model for the topographic mapping of tree structured data. The model is formulated as constrained mixture of hidden Markov tree models. A nat...
128
click to vote
DAM
2006
15 years 4 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
150
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
98
Voted
ISLPED
2003
ACM
15 years 9 months ago
2003
ACM
Multivoltage scheduling (MVS) for datapaths offers the energy savings of voltage scaling on a per-operation basis with a voltage aware operator scheduling. This work investigates...