Optimal constructions of reversible digraphs

DOI10.1016/0166-218X(84)90068-4zbMATH Open0552.90047OpenAlexW2086770208WikidataQ126670784 ScholiaQ126670784MaRDI QIDQ801802FDOQ801802

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

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

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)

Cites Work

• The Transitive Reduction of a Directed Graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some properties of line digraphs
• Title not available (Why is that?)
• Complexity of the minimum-dummy-activities problem in a pert network
• A labeling algorithm to recognize a line digraph and output its root graph
• Optimal constructions of event-node networks
• Title not available (Why is that?)

Cited In (6)

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

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)