Disentangling the Computational Complexity of Network Untangling

We study the network untangling problem introduced by Rozenshtein et al. (Data Min. Knowl. Disc. 35(1), 213–247, 2021), which is a variant of  Vertex Cover on temporal graphs–graphs whose edge set changes over discrete time steps. They introduce two problem variants. The goal is to select at most k...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 68; no. 1; pp. 103 - 121
Main Authors:	Froese, Vincent, Kunz, Pascal, Zschoche, Philipp
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2024 Springer Nature B.V
Subjects:	Apexes Complexity Computer Science Data mining Graph theory Graphs Intervals Parameters Theory of Computation Temporal graph mining Parameterized algorithmics Complexity dichotomy
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!