On the computational complexity of the bipartizing matching problem
- 1 September 2022
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2), 1235-1256
- https://doi.org/10.1007/s10479-021-03966-9
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
This publication has 43 references indexed in Scilit:
- On -improper -coloring of sparse graphsDiscrete Mathematics, 2013
- On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification ProblemsAlgorithmica, 2012
- Partitions of graphs into cographsDiscrete Mathematics, 2010
- Minimum-weight triangulation is NP-hardJournal of the ACM, 2008
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Monadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science, 1993
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valencyJournal of Graph Theory, 1986
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Efficient Planarity TestingJournal of the ACM, 1974