Cited in
(73)- Minimum cost edge blocker clique problem
- An overview of graph covering and partitioning
- A survey of computational methods in protein-protein interaction networks
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Multiple hypernode hitting sets and smallest two-cores with targets
- Protein complex identification based on weighted PPI network with multi-source information
- Statistical inference in a directed network model with covariates
- Protein complex detection algorithm based on multiple topological characteristics in PPI networks
- The densest subgraph problem with a convex/concave size function
- A \(k\)-shell decomposition method for weighted networks
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- \(k\)-partite cliques of protein interactions: a novel subgraph topology for functional coherence analysis on PPI networks
- Exploiting multi-layered information to iteratively predict protein functions
- A graph theoretical approach to data fusion
- Dense subgraphs in random graphs
- On the 2-club polytope of graphs
- Comparison of algorithms in graph partitioning
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Degree-based moment estimation for ordered networks
- Integration of topological measures for eliminating non-specific interactions in protein interaction networks
- Comparing recent methods in graph partitioning
- InterViewer
- MaxCliqueDyn
- Cytoscape
- FASTA
- GO-TermFinder
- CFinder
- BioGRID
- TopKLists
- GeneSigDB
- PreSPI
- BBMCSP
- DIMA
- BBMCW
- IntAct
- ClueGO
- DrugBank
- STRING
- PIPE
- IntScore
- GOurmet
- RRW
- seqSample
- SNN-Cliq
- MultilayerExtraction
- MotifCut
- InterPreTS
- BioLayout
- probitfe
- DPClus
- An order approach for the core maintenance problem on edge-weighted graphs
- The bi-directional h-index and B-core decomposition in directed networks
- Directed weighted random graphs with an increasing bi-degree sequence
- Co-controllability of drug-disease-gene network
- Spectral clustering for detecting protein complexes in protein-protein interaction (PPI) networks
- Distributed core decomposition in probabilistic graphs
- Predicting protein complexes in weighted dynamic PPI networks based on ICSC
- Small cores in 3-uniform hypergraphs
- Degree sequences of monocore graphs
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Partitioning a PPI network into overlapping modules constrained by high-density and periphery tracking
- Node sampling for protein complex estimation in bait-prey graphs
- Multi-way set enumeration in weight tensors
- Graph clustering
- Human dopamine receptors interaction network (DRIN): a systems biology perspective on topology, stability and functionality of the network
- Identification of functional modules in a PPI network by clique percolation clustering
- A note on asymptotic distributions in a network model with degree heterogeneity and homophily
- Why is maximum clique often easy in practice?
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks
- SPMGBA
- Asymptotics in a probit model for directed networks
- Community extraction in multilayer networks with heterogeneous community structure
- A network hierarchy-based method for functional module detection in protein-protein interaction networks
This page was built for software: MCODE
