"The Binary Network Flow Problem is Logspace Complete for P."

Thomas Lengauer, Klaus W. Wagner (1990)

Details and statistics

DOI: 10.1016/0304-3975(90)90101-M

access: open

type: Journal Article

metadata version: 2021-02-17