Sciweavers

328 search results - page 5 / 66
» Graph Algebras for Bigraphs
Sort
View
WG
2010
Springer
14 years 10 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
80
Voted
ENTCS
2002
108views more  ENTCS 2002»
14 years 11 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet
ICASSP
2011
IEEE
14 years 3 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
JCSC
1998
227views more  JCSC 1998»
14 years 11 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
85
Voted
FLOPS
2004
Springer
15 years 5 months ago
Complete Axiomatization of an Algebraic Construction of Graphs
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
Mizuhito Ogawa