Sciweavers

60 search results - page 4 / 12
» Context-Aware Object Connection Discovery in Large Graphs
Sort
View
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 1 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
FSTTCS
2010
Springer
13 years 6 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
CGF
2010
169views more  CGF 2010»
13 years 8 months ago
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
Alexandru Telea, Ozan Ersoy
AAAI
2007
13 years 10 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
ESWS
2010
Springer
14 years 1 months ago
Interactive Relationship Discovery via the Semantic Web
This paper presents an approach for the interactive discovery of relationships between selected elements via the Semantic Web. It emphasizes the human aspect of relationship discov...
Philipp Heim, Steffen Lohmann, Timo Stegemann