731 search results - page 55 / 147 » Reductions to Graph Isomorphism |
EJC
2010
13 years 8 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
DAWAK
2010
Springer
13 years 9 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
COCOON
2006
Springer
14 years 13 days ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
VLSID
2008
IEEE
14 years 9 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...