882 search results - page 92 / 177 » On the Hardness of Graph Isomorphism |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
UC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
DSN
2003
IEEE
14 years 2 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...