882 search results - page 56 / 177 » On the Hardness of Graph Isomorphism |
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
DATE
2005
IEEE
14 years 2 months ago
2005
IEEE
Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a technique for comparing...
EJC
2008
13 years 9 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
SIGMETRICS
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...