Sciweavers

332 search results - page 20 / 67
» Compositions of Graphs Revisited
Sort
View
ACS
2000
13 years 7 months ago
Free Adjunction of Morphisms
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
Lutz Schröder, Horst Herrlich
BIRTHDAY
2004
Springer
14 years 24 days ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
FUIN
2007
95views more  FUIN 2007»
13 years 7 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 4 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...