882 search results - page 50 / 177 » On the Hardness of Graph Isomorphism |
DAM
2010
13 years 9 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
GC
2007
Springer
13 years 8 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...