1,013 Hits in 8.4 sec

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction

Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
In this paper, we propose a new method to decompose a graph into maximal k-edge-connected components, based on random contraction of edges.  ...  into a lot of maximal k-edge-connected subgraphs.  ...  [32] proposed to use maximal k-edge-connected subgraphs (MkECS) as clusters. An MkECS is a maximal subgraph that remains connected no matter how we remove k − 1 or fewer edges in it.  ... 
doi:10.1145/2505515.2505751 dblp:conf/cikm/AkibaIY13 fatcat:it647wnp4ne7dbleooreizekgq

Detecting Conserved Interaction Patterns in Biological Networks

Mehmet Koyutürk, Yohan Kim, Shankar Subramaniam, Wojciech Szpankowski, Ananth Grama
2006 Journal of Computational Biology  
to large numbers of networks.  ...  Conclusions: Using tools presented in this paper, comparative analysis of biological networks at near interactive rates is now feasible.  ...  Acknowledgements This research was supported in part by NIH Grant R01 GM068959-01 and NSF Grant CCR-0208709.  ... 
doi:10.1089/cmb.2006.13.1299 pmid:17037960 fatcat:qq3ei4c5qjbark2lyws7xwhvdy

Sensitive and Specific Identification of Protein Complexes in "Perturbed" Protein Interaction Networks from Noisy Pull-Down Data

William Hendrix, Tatiana Karpinets, Byung-Hoon Park, Eric Schendel, Alok Choudhary, Nagiza F. Samatova
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
Each selection leads to a putative network, where each network in the set of "perturbed" networks differs from the others by a few added or removed edges.  ...  Identification of functional modules in such networks is often based on graph-theoretical methods such as maximal clique enumeration.  ...  ACKNOWLEDGMENT The authors would like to thank the authors of the parallel maximal clique enumeration code and the developers of the biological databases that have been utilized in this study.  ... 
doi:10.1109/ipdps.2011.189 dblp:conf/ipps/HendrixKPSCS11 fatcat:7zkld34r3nebblolm5yghsj47i

Fast Approximation Algorithms for Finding Node-Independent Paths in Networks

Douglas R. White, Mark Newman
2001 Social Science Research Network  
is linear in the graph size.  ...  A variant of the same algorithm can also calculate all the k-components of a graph in the same approximation.  ...  The work reported here was funded in part by the National Science Foundation.  ... 
doi:10.2139/ssrn.1831790 fatcat:qppbqcujyvbg7nzlllwhm4kbgi

Fast Discovery of Reliable Subnetworks

Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
2010 2010 International Conference on Advances in Social Networks Analysis and Mining  
A reliable subgraph gives a concise summary of the connectivity between two given individuals in a social network.  ...  Formally, the given network is seen as a Bernoulli random graph G, and the objective is to find a subgraph H ⊂ G with at most B edges such that the probability that a path exists in H between the given  ...  This work has been supported by the Algorithmic Data Analysis (Algodan) Centre of Excellence of the Academy of Finland (Grant 118653).  ... 
doi:10.1109/asonam.2010.39 dblp:conf/asunam/HintsanenTS10 fatcat:3z3bwlgbtjeihn6b33ve4tq4zu

An $\NC$ Algorithm for Minimum Cuts

David R. Karger, Rajeev Motwani
1997 SIAM journal on computing (Print)  
Another application of these techniques yields an NC algorithm for finding a sparse k-connectivity certificate for all polynomially bounded values of k.  ...  The third result is a derandomization of this RN C solution that requires a combination of two widely used tools: pairwise independence and random walks on expanders.  ...  In O(m + n log n) time, they find a sparse connectivity certificate (i.e., a subgraph that contains all the min-cut edges) that excludes some edge of the graph.  ... 
doi:10.1137/s0097539794273083 fatcat:f4ufalppxjaczdruaz4rypeh2u

Query Optimal k-Plex Based Community in Graphs

Yue Wang, Xun Jian, Zhenhua Yang, Jia Li
2017 Data Science and Engineering  
., include irrelevant subgraphs. In this paper, we propose a new k-plex based community model for community search.  ...  The effectiveness of our model of community and the efficiency of our methods are verified by elaborate experiments.  ...  At the same time, the connectivity of H is guaranteed as H becomes large. The overview properties of a k-plex H are listed as below: 1.  ... 
doi:10.1007/s41019-017-0051-3 fatcat:yyjq7yswlrcmzny56jveipc7uq

A Survey of Community Search Over Big Graphs [article]

Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin
2019 arXiv   pre-print
Recently a large group of research works, called community search, have been proposed. They aim to provide efficient solutions for searching high-quality communities from large networks in real-time.  ...  An important component of these graphs is the network community. Essentially, a community is a group of vertices which are densely connected internally.  ...  Acknowledgments We would like to thank Jiafeng Hu *For lack of space, we use abbreviations for the names of major conferences and journals in database and data mining areas (e.g., we use "PVLDB" to mean  ... 
arXiv:1904.12539v2 fatcat:swx7eervgbbgxpcf6znkx6cne4

Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs

Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2017 ACM Transactions on the Web  
Our algorithms can process real-world graphs with tens of millions of edges in less than an hour. We demonstrate how proposed algorithms can be utilized on a citation network.  ...  The forest of nuclei is a hierarchy by containment, where the edge density increases as we proceed towards leaf nuclei.  ...  In other words, S satisfies both conditions of being a k-(r, s)-nucleus, except maximality. By maximality of S, S = S .  ... 
doi:10.1145/3057742 fatcat:ceazxpnkzre35burhozreoea2e

Robust local community detection

Yubao Wu, Ruoming Jin, Jing Li, Xiang Zhang
2015 Proceedings of the VLDB Endowment  
Given a large network, local community detection aims at finding the community that contains a set of query nodes and also maximizes (minimizes) a goodness metric.  ...  In particular, each node is weighted by its proximity to the query node. We define a query biased density metric to integrate the edge and node weights.  ...  This work was partially supported by the National Science Foundation grants IIS-1162374, IIS-1218036, IIS-0953950, the NIH/NIGMS grant R01GM103309, and the OSC (Ohio Supercomputer Center) grant PGS0218  ... 
doi:10.14778/2752939.2752948 fatcat:pv5jgyyb4jgnnkcr6xl6l2hcde

FPT Algorithms for Finding Near-Cliques in c-Closed Graphs [article]

Balaram Behera, Edin Husić, Shweta Jain, Tim Roughgarden, C. Seshadhri
2021 arXiv   pre-print
In this work, we prove that many different kinds of maximal near-cliques can be enumerated in polynomial time (and FPT in c) for c-closed graphs.  ...  Finding large cliques or cliques missing a few edges is a fundamental algorithmic task in the study of real-world graphs, with applications in community detection, pattern recognition, and clustering.  ...  By Corollary 16, a superset of all maximal independent sets in G can be enumerate in time O(cmn 2 2 c ).SupposeG[S] has an edge, say (u, v).  ... 
arXiv:2007.09768v4 fatcat:z6eu4ca7orez5cdiexwavuzgg4

Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks

Ruoming Jin, Scott McCallen, Eivind Almaas
2007 Seventh IEEE International Conference on Data Mining (ICDM 2007)  
Simply stated, a trend motif describes a recurring subgraph where each of its vertices or edges displays similar dynamics over a userdefined period.  ...  Hence, to fully understand the dynamics of the complex network, we have to consider both network topology and related time series data.  ...  Thus, knowledge of the network topology, paired with the time series data, provides * EA's work was performed under the auspices of DoE by University of California, LLNL under Contract W-7405-Eng-48, with  ... 
doi:10.1109/icdm.2007.92 dblp:conf/icdm/JinMA07 fatcat:vh7boid5rfamllpicrtigg33oy

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity

Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Wenjie Zhang
2015 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data - SIGMOD '15  
With the proliferation of graph applications, the problem of efficiently computing all k-edge connected components of a graph G for a user-given k has been recently investigated.  ...  We also show that the problem of computing the connectivity (rather than the graph details) of SMCC can be solved in linear time regarding the query size (thus, optimal).  ...  A k-edge connected component of a graph G is a maximal vertex-induced subgraph g of G such that g is k-edge connected (i.e., the resulting graph is still connected after the removal of any (k − 1) edges  ... 
doi:10.1145/2723372.2746486 dblp:conf/sigmod/ChangLQYZ15 fatcat:a245smgpzjb5dnweoe3vyjnxvu

Recent Advances in Practical Data Reduction [article]

Faisal Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
2020 arXiv   pre-print
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems.  ...  This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective.  ...  Partially supported by DFG grants MN 59/1-1 and SCHU 2567/1-2.  ... 
arXiv:2012.12594v3 fatcat:vpsucno5cvgotovfiihkyyytba

A hybrid evolutionary algorithm based on ACO and SA for distribution feeder reconfiguration

J Olamaei, A Arefi, A H Mazinan, T Niknam
2010 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE)  
In summary, this research provides a significant contribution to the research areas of social network analysis and mining, and frequent subgraph mining by proposing new types of knowledge, efficient methods  ...  Novel methods of deriving a concise representation are proposed in this thesis, based on the agony minimization concept and greedy heuristic-based edge enumeration.  ...  After enumerating all the edges, the set of hierarchies is identified as connected components in the intermediate network.  ... 
doi:10.1109/iccae.2010.5451699 fatcat:xtkq7vrlzvd33ft2wysg7q2jny
« Previous Showing results 1 — 15 out of 1,013 results