654 search results - page 64 / 131 » Matrix Graph Grammars |
105
click to vote
JCT
1998
15 years 1 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
163
click to vote
AGTIVE
2007
Springer
15 years 5 months ago
2007
Springer
Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanc...
104
click to vote
GG
2008
Springer
15 years 2 months ago
2008
Springer
We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple ...
128
Voted
PR
2007
15 years 28 days ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
107
click to vote
PAMI
2010
14 years 12 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...