Optimal constructions of event-node networks

DOI10.1051/ro/1981150302411zbMath0464.90078OpenAlexW2587148807MaRDI QIDQ3916390

Maciej M. Sysło

Publication date: 1981

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104788

zbMATH Keywords

polynomial time algorithmactivity networksline digraphnetwork analysisapproximate algorithmnetwork constructionproject networkdummy activitiesevent networksevent-node networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A labeling algorithm to recognize a line digraph and output its root graph ⋮ Optimal constructions of reversible digraphs

This page was built for publication: Optimal constructions of event-node networks