Sciweavers

394 search results - page 20 / 79
» Testing subgraphs in large graphs
Sort
View
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
13 years 10 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
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 ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 9 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 7 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
13 years 9 months ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera
FSTTCS
2008
Springer
13 years 10 months ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula