882 search results - page 28 / 177 » On the Hardness of Graph Isomorphism |
ESA
2006
Springer
15 years 3 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
WG
2009
Springer
15 years 4 months ago
2009
Springer
AAAI
2008
15 years 2 months ago
2008
CPM
2008
Springer
15 years 1 months ago
2008
Springer
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE