Sciweavers

941 search results - page 5 / 189
» Efficient Testing of Large Graphs
Sort
View
ICCTA
2007
IEEE
14 years 2 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
JMLR
2008
108views more  JMLR 2008»
13 years 10 months ago
A Recursive Method for Structural Learning of Directed Acyclic Graphs
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
Xianchao Xie, Zhi Geng
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 8 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
CIKM
2009
Springer
14 years 2 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
BMCBI
2010
189views more  BMCBI 2010»
13 years 11 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...