Fixed-Parameter Algorithms for Graph-Modeled Date Clustering

DOI10.1007/978-3-642-02017-9_7zbMATH Open1241.68129OpenAlexW1497587987MaRDI QIDQ3630188FDOQ3630188

Authors: Jiong Guo 

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_7

Recommendations

• scientific article; zbMATH DE number 2011849
• Fixed-parameter algorithms for cluster vertex deletion
• Graph-modeled data clustering: Exact algorithms for clique generation
• On parameterized and kernelization algorithms for the hierarchical clustering problem
• Alternative parameterizations for cluster editing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (1)

• On parameterized and kernelization algorithms for the hierarchical clustering problem

This page was built for publication: Fixed-Parameter Algorithms for Graph-Modeled Date Clustering

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