Sciweavers

406 search results - page 55 / 82
» Dominating Sets in Web Graphs
Sort
View
JSW
2008
203views more  JSW 2008»
13 years 9 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 1 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 11 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
CAISE
2005
Springer
14 years 2 months ago
Querying Tree-Structured Data Using Dimension Graphs
Abstract. Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept hierarchies, e-commerce product catalogs are ex...
Dimitri Theodoratos, Theodore Dalamagas
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
14 years 10 months ago
On Signatures for Communication Graphs
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua...