785 search results - page 10 / 157 » Embedding a Forest in a Graph |
84
Voted
IPL
2010
14 years 10 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
KDD
2002
ACM
16 years 2 days ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
108
Voted
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
PRL
2007
14 years 11 months ago
2007
In this paper, we present a novel methodology to detect and recognize objects in cluttered scenes by proposing boosted contextual descriptors of landmarks in a framework of multi-...
124
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...