5473 search results - page 36 / 1095 » On the graph isomorphism problem |
100
click to vote
ANOR
2005
14 years 11 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
CSR
2008
Springer
15 years 1 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
100
click to vote
IJCNN
2007
IEEE
15 years 6 months ago
2007
IEEE
— The correct segmentation and measurement of mammography images is of fundamental importance for the development of automatic or computer-aided cancer detection systems. In this...