Work

Effective data reduction for strongly stable matching in very sparse graphs

Year: 2024

Type: article

Abstract: We provide a linear-time computable problem kernel of linear size for Strongly Stable Roommates parameterized by the feedback edge number of the acceptability graph (which encodes which agents may be matched to each other). • A linear problem kernel for Strongly Stable Matching is provided. • Stability of a matching is sensible to vertex/edge deletion. • Introduction of annotated problem version helps to design reduction rules.

Source: Information Processing Letters

DOI: 10.1016/j.ipl.2024.106534

Authors: Rosa Wolf, Klaus Heeger, André Nichterlein

Institution: Technische Universität Berlin

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,220

Funder: Deutsche Forschungsgemeinschaft