Sciweavers

1395 search results - page 123 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 3 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
CHI
2010
ACM
15 years 3 months ago
Clutching at straws: using tangible interaction to provide non-visual access to graphs
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
David K. McGookin, Euan Robertson, Stephen A. Brew...
PVLDB
2010
151views more  PVLDB 2010»
14 years 8 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
DM
2010
105views more  DM 2010»
14 years 10 months ago
On k-minimum and m-minimum edge-magic injections of graphs
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...
John P. McSorley, John A. Trono
DM
2010
131views more  DM 2010»
14 years 10 months ago
On a construction of graphs with high chromatic capacity and large girth
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
Bing Zhou