Sciweavers

40 search results - page 3 / 8
» A Relational View of Subgraph Isomorphism
Sort
View
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
ICDAR
2009
IEEE
13 years 5 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
ECCB
2005
IEEE
14 years 1 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
ICPR
2002
IEEE
14 years 8 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
DM
2006
132views more  DM 2006»
13 years 7 months ago
Recursive fault-tolerance of Fibonacci cube in hypercubes
Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last...
Petr Gregor