A general tractable density concept for graphs
From MaRDI portal
Publication:943001
DOI10.1007/S11786-007-0026-2zbMath1144.05063OpenAlexW2143076088MaRDI QIDQ943001
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
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Comparison of relative density of two random geometric digraph families in testing spatial clustering ⋮ In search of the densest subgraph
This page was built for publication: A general tractable density concept for graphs
