2487 search results - page 270 / 498 » Partitions of Graphs into Trees |
117
Voted
IJCV
2007
15 years 3 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
235
Voted
DISOPT
2011
14 years 10 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
160
Voted
SAC
2011
ACM
14 years 6 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
144
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
150
Voted
BICOB
2009
Springer
15 years 10 months ago
2009
Springer
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...