5473 search results - page 12 / 1095 » On the graph isomorphism problem |
DM
2002
13 years 10 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
GD
2004
Springer
14 years 4 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
COCOON
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
ICDE
2009
IEEE
13 years 8 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...