Sciweavers

323 search results - page 9 / 65
» Dualizability and graph algebras
Sort
View
IMCSIT
2010
13 years 5 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
INFOVIS
2002
IEEE
14 years 17 days ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
CAI
2007
Springer
14 years 1 months ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
ENTCS
2002
141views more  ENTCS 2002»
13 years 7 months ago
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
Neil Ghani, Christoph Lüth, Federico De March...
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
14 years 28 days ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka