15 search results - page 1 / 3 » Bounded Color Multiplicity Graph Isomorphism is in the |
COCO
2005
Springer
15 years 7 months ago
2005
Springer
116
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
114
click to vote
COMBINATORICS
1999
15 years 1 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 (...
115
click to vote
GC
2007
Springer
15 years 2 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
126
click to vote
EJC
2008
15 years 2 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...