394 search results - page 15 / 79 » Testing subgraphs in large graphs |
170
Voted
ISVC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we present a novel graph, sub-graph and supergraph based face representation which captures the facial shape changes and deformations caused due to pose ch...
172
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
199
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
173
click to vote
COMBINATORICS
2006
15 years 5 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
146
click to vote
PAKDD
2010
ACM
15 years 10 months ago
2010
ACM
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...