205 search results - page 10 / 41 » Pruning 2-Connected Graphs |
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
DM
2007
13 years 7 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
PAMI
2008
13 years 7 months ago
2008
This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geo...
DASFAA
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract. Graph-structured databases have numerous recent applications including the Semantic Web, biological databases and XML, among many others. In this paper, we study the main...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...