114 search results - page 8 / 23 » An efficient condition for a graph to be Hamiltonian |
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
BMCBI
2010
13 years 7 months ago
2010
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
ADC
2008
Springer
14 years 1 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
UAI
2008
13 years 8 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...