A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2017.01.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2584187496 / rank | |||
Normal rank | |||
Revision as of 20:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs |
scientific article |
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
