MCODE

swMATH35748MaRDI QIDQ51450FDOQ51450

Author name not available (Why is that?)

Cited In (43)

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

This page was built for software: MCODE