Sciweavers

1056 search results - page 75 / 212
» Constraint-Based Graph Matching
Sort
View
EDOC
2009
IEEE
14 years 1 months ago
Aligning Business Process Models
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 3 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
ICML
2007
IEEE
14 years 10 months ago
Scalable modeling of real graphs using Kronecker multiplication
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
Jure Leskovec, Christos Faloutsos
LATIN
2010
Springer
14 years 4 months ago
Optimal Polygonal Representation of Planar Graphs
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Step...