5473 search results - page 35 / 1095 » On the graph isomorphism problem |
CIE
2008
Springer
15 years 1 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
108
click to vote
ECCC
2010
14 years 10 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(1) , where the parameter b is the maximum size of the col...
EDBT
2008
ACM
15 years 1 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...