MCODE

swMATH35748MaRDI QIDQ51450

No author found.

Related Items (43)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Minimum cost edge blocker clique problem ⋮ Comparison of algorithms in graph partitioning ⋮ A graph theoretical approach to data fusion ⋮ \(k\)-partite cliques of protein interactions: a novel subgraph topology for functional coherence analysis on PPI networks ⋮ An overview of graph covering and partitioning ⋮ An order approach for the core maintenance problem on edge-weighted graphs ⋮ Directed weighted random graphs with an increasing bi-degree sequence ⋮ Small cores in 3-uniform hypergraphs ⋮ The bi-directional h-index and B-core decomposition in directed networks ⋮ Partitioning a PPI network into overlapping modules constrained by high-density and periphery tracking ⋮ Degree-based moment estimation for ordered networks ⋮ A note on asymptotic distributions in a network model with degree heterogeneity and homophily ⋮ Asymptotics in a probit model for directed networks ⋮ Predicting protein complexes in weighted dynamic PPI networks based on ICSC ⋮ Identification of functional modules in a PPI network by clique percolation clustering ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Human dopamine receptors interaction network (DRIN): a systems biology perspective on topology, stability and functionality of the network ⋮ On the 2-Club Polytope of Graphs ⋮ Multi-way set enumeration in weight tensors ⋮ Spectral clustering for detecting protein complexes in protein-protein interaction (PPI) networks ⋮ Node sampling for protein complex estimation in bait-prey graphs ⋮ Exploiting multi-layered information to iteratively predict protein functions ⋮ Protein complex detection algorithm based on multiple topological characteristics in PPI networks ⋮ A network hierarchy-based method for functional module detection in protein-protein interaction networks ⋮ Graph clustering ⋮ Ak-shell decomposition method for weighted networks ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ Co-controllability of drug-disease-gene network ⋮ Dense subgraphs in random graphs ⋮ Two local dissimilarity measures for weighted graphs with application to protein interaction networks ⋮ Protein complex identification based on weighted PPI network with multi-source information ⋮ Cliques with maximum/minimum edge neighborhood and neighborhood density ⋮ Degree sequences of monocore graphs ⋮ Asymptotics in directed exponential random graph models with an increasing bi-degree sequence ⋮ The densest subgraph problem with a convex/concave size function ⋮ Integration of topological measures for eliminating non-specific interactions in protein interaction networks ⋮ Statistical Inference in a Directed Network Model With Covariates ⋮ Multiple hypernode hitting sets and smallest two-cores with targets ⋮ A survey of computational methods in protein-protein interaction networks ⋮ Unnamed Item ⋮ Comparing recent methods in graph partitioning ⋮ Distributed Core Decomposition in Probabilistic Graphs

This page was built for software: MCODE