×

Found 870 Documents (Results 1–100)

100
MathJax

Distributed detection of clusters of arbitrary size. (English) Zbl 07495150

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 370-387 (2021).
MSC:  68Mxx 68Q11 68R10
PDF BibTeX XML Cite
Full Text: DOI

A distributed algorithm for spectral sparsification of graphs with applications to data clustering. (English) Zbl 1483.68259

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 403-413 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Secondary structure ensemble analysis via community detection. (English) Zbl 1460.92155

Segal, Rebecca (ed.) et al., Using mathematics to understand biological complexity. From cells to populations. Selected papers of the collaborative workshop for woman in mathematical biology, University of California, Los Angeles, CA, USA, June 17–21, 2019. Cham: Springer. Assoc. Women Math. Ser. 22, 55-81 (2021).
MSC:  92D20
PDF BibTeX XML Cite
Full Text: DOI

Graph clustering in all parameter regimes. (English) Zbl 07559410

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 39, 15 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs. (English) Zbl 1482.68176

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 97-107 (2020).
MSC:  68R10 05C70 68W25
PDF BibTeX XML Cite
Full Text: DOI

An approximation algorithm for a semi-supervised graph clustering problem. (English) Zbl 1460.90149

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 23-29 (2020).
MSC:  90C27 90C59
PDF BibTeX XML Cite
Full Text: DOI

A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem. (English) Zbl 1460.90147

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 3-15 (2020).
MSC:  90C27 90C35
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software