Dense Subgraphs in Biological Networks

DOI10.1007/978-3-030-38919-2_60zbMath1447.92167OpenAlexW3000098402MaRDI QIDQ3297795

Mohammad Mehdi Hosseinzadeh

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_60

zbMATH Keywords

heuristicsgraph algorithmsbiological networksdense subgraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Systems biology, networks (92C42)

Uses Software

• MotifCut

Cites Work

• Multivariate algorithmics for finding cohesive subnetworks
• Top-\(k\) overlapping densest subgraphs
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• A graph‐theoretic definition of a sociometric clique†
• Greedily Finding a Dense Subgraph
• Reducibility among Combinatorial Problems
• Covering a Graph with Clubs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dense Subgraphs in Biological Networks