882 search results - page 26 / 177 » On the Hardness of Graph Isomorphism |
COMBINATORICS
2006
13 years 9 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
JCT
2008
13 years 9 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...