882 search results - page 67 / 177 » On the Hardness of Graph Isomorphism |
DAGSTUHL
2004
13 years 10 months ago
2004
Even sophisticated techniques start out from simple ideas. Later, in reply to application needs or theoretical problems new concepts are introduced and new formalisations proposed...
IJCAI
2001
13 years 10 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
EUROCRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...
ECCC
2007
13 years 8 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
ACCV
2009
Springer
14 years 3 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...