Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem (Q4007453)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem |
scientific article |
Statements
Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem (English)
0 references
27 September 1992
0 references
bipartite graph
0 references
isotone function
0 references
