The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:50, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of disconnected cut and \(2 K_2\)-partition |
scientific article |
Statements
The computational complexity of disconnected cut and \(2 K_2\)-partition (English)
0 references
5 March 2015
0 references
disconnected cut
0 references
\(2K_2\)-partition
0 references
biclique cover
0 references
