Sciweavers

5473 search results - page 60 / 1095
» On the graph isomorphism problem
Sort
View
CP
2009
Springer
16 years 15 days ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
EJC
2010
14 years 12 months ago
The edge-flipping group of a graph
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
Hau-wen Huang, Chih-wen Weng
DAWAK
2010
Springer
15 years 29 days ago
Frequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
Chuntao Jiang, Frans Coenen, Michele Zito
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 12 months ago
New Results on Quantum Property Testing
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
ECIS
2001
15 years 1 months ago
Using Problem-Domain and Artefact-Domain Architectural Modelling to Understand System Evolution
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
Thomas R. Addis, Galal Hassan Galal