On Fulkerson's Conjecture About Consistent Labeling Processes

DOI10.1287/MOOR.4.3.265MaRDI QIDQ3887269zbMATH OpenOpenAlexWikidataFDO

Authors 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 complexityconsistent labeling processexponential number of augmentationsFord-Fulkerson max-flow algorithmpolynomial algorithmsequence of networks

Mathematics Subject Classification ID

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

Cited in

(1)

• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887269)