882 search results - page 27 / 177 » On the Hardness of Graph Isomorphism |
110
click to vote
DM
1998
14 years 11 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
96
Voted
STOC
2007
ACM
16 years 2 days ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
103
click to vote
DAM
2011
14 years 6 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
ALGORITHMICA
2004
14 years 11 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
JSAT
2006
14 years 11 months ago
2006
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with i...