Sciweavers

323 search results - page 44 / 65
» Dualizability and graph algebras
Sort
View
ENTCS
2008
98views more  ENTCS 2008»
13 years 7 months ago
A Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
Oana Andrei, Hélène Kirchner
JCT
2006
69views more  JCT 2006»
13 years 7 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans
DM
2002
85views more  DM 2002»
13 years 7 months ago
Equimodular curves
This paper is a continuation of Equimodular curves, LSE-CDAM-2000-17. First, it is shown by algebraic means that the equimodular curves for a reducible matrix are closed curves. T...
Norman Biggs
MFCS
2009
Springer
14 years 2 months ago
Synchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
Didier Caucal
CIE
2009
Springer
13 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch