On graphs associated to sets of rankings
From MaRDI portal
Publication:491081
DOI10.1016/j.cam.2015.03.009zbMath1319.05129OpenAlexW1971240385MaRDI QIDQ491081
Francisco Pedroche, Regino Criado, Miguel Romance, Esther García
Publication date: 24 August 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.03.009
Related Items (2)
Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ Editorial: Mathematical modeling and computational methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitivity groups on social network sites
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
- On the complexity of crossings in permutations
- Comparability graphs and intersection graphs
- On the localization of the personalized PageRank of complex networks
- Connected permutation graphs
- A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues
- Seidel Minor, Permutation Graphs and Combinatorial Properties
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Graph Classes: A Survey
- Handbook of Graph Theory
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- A NEW MEASURE OF RANK CORRELATION
- Partially Ordered Sets
- Graph Drawing
This page was built for publication: On graphs associated to sets of rankings
