Reference : Tutorials for using the Digraph3 Python software collection
Learning materials : Other
Engineering, computing & technology : Computer science
Computational Sciences
Tutorials for using the Digraph3 Python software collection
Bisdorff, Raymond mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Documentation of the Digraph3 software collection
[en] Outranking Digraphs ; Python3 modules ; Algorithmic Decision Theory
[en] The documentation contains a set of tutorials introducing the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank with multiple incommensurable ranking criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs. The tutorial about split, interval and permutation graphs is inspired by Martin Ch. Golumbic’s book on Algorithmic Graph Theory and Perfect Graphs. Finally, we provide a tutorial on tree graphs and spanning forests.
University of Luxembourg: High Performance Computing - ULHPC

File(s) associated to this reference

Fulltext file(s):

Open access
digraph3Tutorial.pdfVersion June 2022Author postprint5.87 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.