Mining the largest quasi-clique in human protein interactome
M Bhattacharyya… - … conference on adaptive …, 2009 - ieeexplore.ieee.org
A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module
of vertices within a graph. However, in many real-world situations, the classical problem of
finding a clique is required to be relaxed. This motivates the problem of finding quasicliques
that are almost complete subgraphs of a graph. In sparse and very large scale-free
networks, the problem of finding the largest quasi-clique becomes hard to manage with the
existing approaches. Here, we propose a heuristic algorithm in this paper for locating the …
of vertices within a graph. However, in many real-world situations, the classical problem of
finding a clique is required to be relaxed. This motivates the problem of finding quasicliques
that are almost complete subgraphs of a graph. In sparse and very large scale-free
networks, the problem of finding the largest quasi-clique becomes hard to manage with the
existing approaches. Here, we propose a heuristic algorithm in this paper for locating the …
Mining the Largest Quasi-clique in Human Protein Interactome
S Bandyopadhyay, M Bhattacharyya - Nature Precedings, 2012 - nature.com
A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module
of vertices within a graph. However, in many real-world situations, the classical problem of
finding a clique is required to be relaxed. This motivates the problem of finding quasicliques
that are almost complete subgraphs of a graph. In sparse and very large scale-free
networks, the problem of finding the largest quasi-clique becomes hard to manage with the
existing approaches. Here, we propose a heuristic algorithm in this paper for locating the …
of vertices within a graph. However, in many real-world situations, the classical problem of
finding a clique is required to be relaxed. This motivates the problem of finding quasicliques
that are almost complete subgraphs of a graph. In sparse and very large scale-free
networks, the problem of finding the largest quasi-clique becomes hard to manage with the
existing approaches. Here, we propose a heuristic algorithm in this paper for locating the …
以上显示的是最相近的搜索结果。 查看全部搜索结果