Computing the largest bond of a graph

DOI10.4230/LIPIcs.IPEC.2019.12OpenAlexW2998413209MaRDI QIDQ5875544

Gabriel L. Duarte, Daniel Lokshtanov, Rafael C. S. Schouery, Uéverton S. Souza, Lehilton L. C. Pedrosa

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1910.01071

zbMATH Keywords

treewidthmaximum cutcutclique-widthFPTbondconnected cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Finding a maximum minimal separator: graph classes and fixed-parameter tractability ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints

This page was built for publication: Computing the largest bond of a graph