Matching cut in graphs with large minimum degree
From MaRDI portal
Publication:5919446
DOI10.1007/978-3-030-26176-4_25OpenAlexW2963218931MaRDI QIDQ5919446
Sun-Yuan Hsieh, Van Bang Le, Hoàng-Oanh Le, Sheng-Lung Peng
Publication date: 24 February 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-26176-4_25
Related Items (5)
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ Matching cut in graphs with large minimum degree ⋮ An FPT algorithm for matching cut and d-cut
This page was built for publication: Matching cut in graphs with large minimum degree
