Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Ranking the vertices of a complete multipartite paired comparison digraph

From MaRDI portal
Publication:1923602
Jump to:navigation, search

DOI10.1016/0166-218X(95)00077-5zbMath0868.68083MaRDI QIDQ1923602

Anders Yeo, Gregory Gutin

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


zbMATH Keywords

paired comparison digraph


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)



Uses Software

  • heapsort


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1923602&oldid=14344331"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki