882 search results - page 37 / 177 » On the Hardness of Graph Isomorphism |
GD
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic gra...
AC
2000
Springer
14 years 1 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
EJC
2008
13 years 9 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
COMBINATORICA
2007
13 years 9 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
JCT
2008
13 years 9 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...