Partitioning to three matchings of given size is NP-complete for bipartite graphs
Metrics
DOI: https://doi.org/10.1515/ausi-2015-0004 | Journal eISSN: 2066-7760
Language: English
Page range: 206 - 209
Submitted on: Jul 11, 2014
Published on: Jan 27, 2015
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year
Related subjects:
© 2015 Dömötör Pálvölgyi, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.