Extracting densest sub-hypergraph with convex edge-weight functions

DOI10.1007/978-3-031-20350-3_25arXiv2207.08340MaRDI QIDQ6111968

No author found.

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.08340

zbMATH Keywords

hypergraphconvex functiondensest subgraph problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The densest subgraph problem with a convex/concave size function
• On Finding Dense Subgraphs
• A new approach to the maximum-flow problem
• Greedily Finding a Dense Subgraph
• Unnamed Item
• Unnamed Item

This page was built for publication: Extracting densest sub-hypergraph with convex edge-weight functions