Optimal constructions of reversible digraphs

DOI10.1016/0166-218X(84)90068-4zbMath0552.90047OpenAlexW2086770208WikidataQ126670784 ScholiaQ126670784MaRDI QIDQ801802

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

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

Related Items (3)

Activity nets: A guided tour through some recent developments ⋮ Minimizing the jump number for partially ordered sets: A graph-theoretic approach ⋮ On Page Number of N-free Posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of line digraphs
• 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
• The Transitive Reduction of a Directed Graph

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