Ranking the vertices of a complete multipartite paired comparison digraph
From MaRDI portal
Publication:1923602
DOI10.1016/0166-218X(95)00077-5zbMath0868.68083MaRDI QIDQ1923602
Publication date: 17 August 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Uses Software
Cites Work
- Unnamed Item
- Counting linear extensions
- Ranking the vertices of an r-partite paired comparison digraph
- Ranking the Vertices of a Paired Comparison Digraph
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Ranking the vertices of a weighted digraph using the length of forward arcs
- Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
This page was built for publication: Ranking the vertices of a complete multipartite paired comparison digraph