1097 search results - page 24 / 220 » Testing Graph Isomorphism |
PVLDB
2010
14 years 8 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
DM
2006
14 years 9 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
COMBINATORICS
2006
14 years 9 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
DM
2006
14 years 9 months ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...