Dynamic Graph Clustering Using Minimum-Cut Trees

From MaRDI portal

Revision as of 21:52, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5894773

Jump to:navigation, search

DOI10.7155/jgaa.00269zbMath1254.05187OpenAlexW1967309200MaRDI QIDQ5894773

Dorothea Wagner, Robert Görke, Tanja Hartmann

Publication date: 4 December 2012

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00269

zbMATH Keywords

clustering algorithm

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Dynamic Graph Clustering Using Minimum-Cut Trees

This page was built for publication: Dynamic Graph Clustering Using Minimum-Cut Trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5894773&oldid=16233107"