323 search results - page 4 / 65 » Dualizability and graph algebras |
85
Voted
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
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.
COMBINATORICS
2007
14 years 11 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
85
Voted
COMBINATORICS
1999
14 years 11 months ago
1999
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
102
Voted
EUROMICRO
1996
IEEE
15 years 3 months ago
1996
IEEE
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
108
Voted
ECCV
1994
Springer
16 years 1 months ago
1994
Springer
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...