Optimal constructions of reversible digraphs

DOI10.1016/0166-218X(84)90068-4MaRDI QIDQ801802zbMATH OpenOpenAlexWikidataFDO

Authors Maciej M. Sysło

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(84)90068-4

zbMATH Keywords

algorithmsproject schedulingprecedence constraintsactivity networkarc set splittingarc subdivisiondummy arcsevent networkoptimal reversible digraphsPert networkproject network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35)

Recommendations

• Transitively reduced and transitively closed event networks
• On the computational complexity of the minimum-dummy-activities problem in a pert network
• On the minimum dummy-arc problem
• Publication:4509382
• A new method for constructing a minimal PERT network

Cites work

• scientific article; zbMATH DE number 3675952 (Why is no real title available?)
• scientific article; zbMATH DE number 3465341 (Why is no real title available?)
• scientific article; zbMATH DE number 3428963 (Why is no real title available?)
• scientific article; zbMATH DE number 3218572 (Why is no real title available?)
• A labeling algorithm to recognize a line digraph and output its root graph
• Complexity of the minimum-dummy-activities problem in a pert network
• Optimal constructions of event-node networks
• Some properties of line digraphs
• The Transitive Reduction of a Directed Graph

Cited in

(6)

• Transitively reduced and transitively closed event networks
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• Reverse binary graphs
• On Page Number of N-free Posets
• Efficient Output-Sensitive Construction of Reeb Graphs
• Activity nets: A guided tour through some recent developments

This page was built for publication: Optimal constructions of reversible digraphs

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