A general tractable density concept for graphs

DOI10.1007/S11786-007-0026-2MaRDI QIDQ943001zbMATH OpenOpenAlexFDO

Authors Andras Farago

Publication date 8 September 2008

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0026-2

zbMATH Keywords

densest subgraphgraph algorithmgraph density

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Finding Dense Subgraphs
• Determination of the densest subgraph
• The densest subgraph problem with a convex/concave size function
• Finding dense subgraphs of sparse graphs
• In search of the densest subgraph

Cited in

(10)

• Comparison of relative density of two random geometric digraph families in testing spatial clustering
• The densest subgraph problem with a convex/concave size function
• Density functions subject to a co-matroid constraint
• scientific article; zbMATH DE number 4122023 (Why is no real title available?)
• Fast algorithms for constrained graph density problems
• On Finding Dense Subgraphs
• The density maximization problem in graphs
• In search of the densest subgraph
• Determination of the densest subgraph
• The densest subgraph problem with a convex/concave size function

This page was built for publication: A general tractable density concept for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943001)