On Fulkerson's Conjecture About Consistent Labeling Processes

DOI10.1287/moor.4.3.265zbMath0443.90107OpenAlexW2158161083WikidataQ123232854 ScholiaQ123232854MaRDI QIDQ3887269

Nimrod Megiddo, Zvi Galil

Publication date: 1979

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7ae17cbfd1f4bbacb972f09ee647bf652f781b14

zbMATH Keywords

computational complexitypolynomial algorithmconsistent labeling processexponential number of augmentationsFord-Fulkerson max-flow algorithmsequence of networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items

Cost-effective allocations of bounded and binary resources in polynomial time

This page was built for publication: On Fulkerson's Conjecture About Consistent Labeling Processes