16 search results - page 2 / 4 » Large Maximal Cliques Enumeration in Large Sparse Graphs |
DAWAK
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
MST
2010
13 years 2 days ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
AI
2006
Springer
13 years 5 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
IOR
2011
13 years 8 days ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...