5473 search results - page 197 / 1095 » On the graph isomorphism problem |
220
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
165
click to vote
4OR
2007
15 years 7 months ago
2007
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
185
click to vote
MFCS
2004
Springer
16 years 16 days ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
206
click to vote
WG
2004
Springer
16 years 15 days ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
179
Voted
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...