STACS 1994 Annual Symposium on Theoretical Aspects of Computer Science
 |  |
Wall of Fame | Most Viewed STACS-1994 Paper
STACS
1994
Springer
14 years 3 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 148 | ||
| 2 | | 117 | ||
| 3 | | 103 | ||
| 4 | | 98 |