A partitioning-based divisive clustering technique for maximizing the modularity.
Ü. Çatalyürek, K. Kaya, J. Langguth, and B. Uçar. Graph Partitioning and Graph Clustering, volume 588 of Contemporary Mathematics, page 171-186. American Mathematical Society, (2012)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dimacs/CatalyurekKLU12
%A Çatalyürek, Ümit V.
%A Kaya, Kamer
%A Langguth, Johannes
%A Uçar, Bora
%B Graph Partitioning and Graph Clustering
%D 2012
%E Bader, David A.
%E Meyerhenke, Henning
%E Sanders, Peter
%E Wagner, Dorothea
%I American Mathematical Society
%K dblp
%P 171-186
%T A partitioning-based divisive clustering technique for maximizing the modularity.
%U http://dblp.uni-trier.de/db/conf/dimacs/dimacs2012.html#CatalyurekKLU12
%V 588
%@ 978-0-8218-9869-7
@inproceedings{conf/dimacs/CatalyurekKLU12,
added-at = {2013-04-15T00:00:00.000+0200},
author = {Çatalyürek, Ümit V. and Kaya, Kamer and Langguth, Johannes and Uçar, Bora},
biburl = {https://www.bibsonomy.org/bibtex/29a9eb6a221fbc62d23764b90bed7e480/dblp},
booktitle = {Graph Partitioning and Graph Clustering},
crossref = {conf/dimacs/2012},
editor = {Bader, David A. and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
ee = {http://www.ams.org/books/conm/588/11712},
interhash = {c7dcc2036d530e5a30d6db78127e66fc},
intrahash = {9a9eb6a221fbc62d23764b90bed7e480},
isbn = {978-0-8218-9869-7},
keywords = {dblp},
pages = {171-186},
publisher = {American Mathematical Society},
series = {Contemporary Mathematics},
timestamp = {2020-11-04T11:36:54.000+0100},
title = {A partitioning-based divisive clustering technique for maximizing the modularity.},
url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs2012.html#CatalyurekKLU12},
volume = 588,
year = 2012
}
