Work

Parameterized Complexity of Weighted Multicut in Trees

Year: 2022

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-031-15914-5_19

Authors: Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Institutions: Helmholtz Center for Information Security, Max Planck Institute for Informatics

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4313041985

FWCI: 2.063

Cites: 22

Cited by: 6

Related to: 10