A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs |
scientific article; zbMATH DE number 6687381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs |
scientific article; zbMATH DE number 6687381 |
Statements
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (English)
0 references
21 February 2017
0 references
graph algorithms
0 references
maximum cut
0 references
proper interval graph
0 references
