Cluster Editing for Multi-Layer and Temporal Graphs
- 3 July 2024
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (5) , 1239-1290
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FP7 People: Marie-Curie Actions (631163.11)
- Horizon 2020 (677651,714704)
- Israel Science Foundation (551145/14,1456/18,551145/14)
- Deutsche Forschungsgemeinschaft (NI 369/17)
- European Research Council (949707)
- Czech Science Foundation (17-20065S)
- OP VVV MEYS (CZ.02.1.01/0.0/0.0/16 019/0000765)
This publication has 68 references indexed in Scilit:
- A New Temporal Interpretation of Cluster Editing2022
- LP-Based Algorithms for Multistage Minimization Problems2021
- A Multistage View on 2-Satisfiability2021
- Parameterized Algorithms2015
- Changing Bases: Multistage Optimization for Matroids and Matchings2014
- Fundamentals of Parameterized Complexity2013
- Cluster Editing2013
- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex CoverLecture Notes in Computer Science, 2004
- Connectivity and Inference Problems for Temporal NetworksJournal of Computer and System Sciences, 2002
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955