On the calculation of transitive reduction-closure of orders
From MaRDI portal
Publication:686479
DOI10.1016/0012-365X(93)90164-OzbMath0782.68089MaRDI QIDQ686479
Michel Morvan, Michel A. Habib, Jean-Xavier Rampon
Publication date: 13 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items
Computing the jump number on semi-orders is polynomial, Mixed-integer linear programming for resource leveling problems, Interval graph representation with given interval and intersection lengths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved algorithm for transitive closure on acyclic digraphs
- Transitive closure for restricted classes of partial orders
- Complexité de problèmes liés aux graphes sans circuit
- Incremental modular decomposition
- The Recognition of Series Parallel Digraphs
- A transitive closure algorithm
- The Transitive Reduction of a Directed Graph
- A Theorem on Boolean Matrices
