Authors: Thinh D. Nguyen
The study of perebor dates back to the Soviet-era mathematics, especially in the 1980s . Post-Soviet mathematicians have been working on many problems in combinatorial optimization. One of them is Maximum Edge Biclique Problem (MBP). In , the author proves that MBP is NP-complete. In this note, we give a polynomial time algorithm for MBP by using linear programming (LP). Thus, some flaw needs to be found in Peeter's work. We leave this to the community.
Comments: 2 Pages.
[v1] 2018-06-18 00:11:02
Unique-IP document downloads: 5 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.