882 search results - page 52 / 177 » On the Hardness of Graph Isomorphism |
SIBGRAPI
2008
IEEE
14 years 3 months ago
2008
IEEE
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
DAM
2010
13 years 9 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
EJC
2010
13 years 9 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 10 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 ...
FAW
2009
Springer
14 years 3 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...