328 search results - page 2 / 66 » Graph Algebras for Bigraphs |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
MODELS
2007
Springer
14 years 11 days ago
2007
Springer
ant Talks Abstracts Modelling Tools: Claudia Ermel: Tiger Harmen Kastenberg: GROOVE Christian Köhler: EMF Model Transformation Ákos Horváth: The VIATRA2 Model Transformation Fra...
DAM
2006
13 years 6 months ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
ISCAS
1999
IEEE
13 years 10 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
DM
2000
13 years 6 months ago
2000
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...