124 search results - page 10 / 25 » Undirected Graphs of Entanglement Two |
ICMCS
2005
IEEE
15 years 4 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
116
click to vote
ESA
2007
Springer
15 years 4 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
KDD
1997
ACM
15 years 2 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
ALGORITHMICA
2008
14 years 10 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...