5473 search results - page 137 / 1095 » On the graph isomorphism problem |
158
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
660
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
213
click to vote
CATS
2008
15 years 8 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
142
click to vote
AUSAI
2005
Springer
16 years 15 days ago
2005
Springer
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
214
Voted
ICALP
2004
Springer
16 years 10 days ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...