Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem

DOI10.1007/BF01068200zbMath0800.68613OpenAlexW2086886617MaRDI QIDQ4007453

L. V. Knyazeva, Timkovsky, Vadim G.

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068200

zbMATH Keywords

bipartite graphisotone function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• NP-complete scheduling problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem