Sciweavers

5473 search results - page 10 / 1095
» On the graph isomorphism problem
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 11 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
JCB
2007
118views more  JCB 2007»
13 years 10 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
ISTCS
1997
Springer
14 years 3 months ago
Faster subtree isomorphism
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
Ron Shamir, Dekel Tsur
LICS
2010
IEEE
13 years 8 months ago
The Isomorphism Problem on Classes of Automatic Structures
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
Dietrich Kuske, Jiamou Liu, Markus Lohrey
CORR
2007
Springer
69views Education» more  CORR 2007»
13 years 11 months ago
Lossless Representation of Graphs using Distributions
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Mireille Boutin, Gregor Kemper