731 search results - page 54 / 147 » Reductions to Graph Isomorphism |
122
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
125
click to vote
ICMLA
2009
15 years 1 months ago
2009
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
131
click to vote
ICDAR
2009
IEEE
15 years 10 months ago
2009
IEEE
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
137
click to vote
SIBGRAPI
2008
IEEE
15 years 10 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...
144
click to vote
DAM
2010
15 years 3 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...