Finding dense subgraphs with maximum weighted triangle density
From MaRDI portal
Publication:2666852
DOI10.1016/j.ins.2020.06.004zbMath1474.68230OpenAlexW3035639025MaRDI QIDQ2666852
Qianli Ma, Jia Wei, Jiabing Wang, Gui-Hua Wen, Rongjie Wang
Publication date: 23 November 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.06.004
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Complexity of finding dense subgraphs
- Top-\(k\) overlapping densest subgraphs
- Finding lasting dense subgraphs
- Near optimal solutions for maximum quasi-bicliques
- From the Cover: The structure of scientific collaboration networks
- Detecting high log-densities
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Finding Dense Subgraphs with Size Bounds
- On Finding Dense Subgraphs
- A Faster Deterministic Maximum Flow Algorithm
- Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph
- A Fast Parametric Maximum Flow Algorithm and Applications
- Greedily Finding a Dense Subgraph
- Max flows in O(nm) time, or better
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- The dense \(k\)-subgraph problem
This page was built for publication: Finding dense subgraphs with maximum weighted triangle density
