142 search results - page 11 / 29 » Filtering for Subgraph Isomorphism |
DASFAA
2008
IEEE
13 years 9 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
DAWAK
2010
Springer
13 years 8 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
DM
2008
13 years 7 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
DM
2006
13 years 7 months ago
2006
Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last...
DM
2006
13 years 7 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...