Maximizing Matching Cuts

Le, Van Bang; Lucke, Felicia; Paulusma, Daniël; Ries, Bernard

doi:10.1007/978-3-030-54621-2_898-1

Maximizing Matching Cuts

Le, Van Bang; Lucke, Felicia; Paulusma, Daniël; Ries, Bernard

Authors

Van Bang Le

Dr Felicia Lucke felicia.c.lucke@durham.ac.uk
Postdoctoral Research Associate

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Bernard Ries

Contributors

Panos M. Pardalos
Editor

Oleg A. Prokopyev
Editor

Abstract

Graph cut problems belong to a well-studied class of classical graph problems related to network connectivity, which is a central concept within theoretical computer science.

Citation

Le, V. B., Lucke, F., Paulusma, D., & Ries, B. (2024). Maximizing Matching Cuts. In P. M. Pardalos, & O. A. Prokopyev (Eds.), Encyclopedia of Optimization (1-10). Springer Nature. https://doi.org/10.1007/978-3-030-54621-2_898-1

Online Publication Date	Dec 8, 2024
Publication Date	2024
Deposit Date	Dec 9, 2024
Publicly Available Date	Dec 9, 2025
Publisher	Springer Nature
Peer Reviewed	Not Peer Reviewed
Pages	1-10
Book Title	Encyclopedia of Optimization
ISBN	9783030546212
DOI	https://doi.org/10.1007/978-3-030-54621-2_898-1
Public URL	https://durham-repository.worktribe.com/output/3212038