323 search results - page 1 / 65 » Dualizability and graph algebras |
DM
2000
13 years 7 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...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
SBMF
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because...
TGC
2010
Springer
13 years 5 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
ACSC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...