882 search results - page 76 / 177 » On the Hardness of Graph Isomorphism |
SPAA
1997
ACM
15 years 4 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
COMBINATORICS
2000
14 years 11 months ago
2000
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
125
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
TCS
2010
14 years 6 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
DATE
2008
IEEE
15 years 6 months ago
2008
IEEE
This work addresses the issue of design optimization for faulttolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpoin...