Article
A Shapley distance in graphs
Author/s | Gallardo Morilla, José Manuel
Jiménez Jiménez, María Nieves Jiménez Losada, Andrés |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada II |
Publication Date | 2018-03 |
Deposit Date | 2024-01-18 |
Published in |
|
Abstract | A new distance in finite graphs is defined through a game-theoretic approach. This distance arises when solving the problem about the fair cost, for a node in a graph, of attaining access to another node. The distance ... A new distance in finite graphs is defined through a game-theoretic approach. This distance arises when solving the problem about the fair cost, for a node in a graph, of attaining access to another node. The distance indicates the level of difficulty in the communication between any pair of nodes, on the understanding that the fewer paths there are between two nodes and the more nodes there are that form those paths, the greater the distance is. |
Funding agencies | Ministerio de Ciencia e Innovación (MICIN). España |
Project ID. | ECO2013-17766-P |
Citation | Gallardo, J.M., Jiménez, M.N. y Jiménez-Losada, A. (2018). A Shapley distance in graphs. Information Sciences, 432, 269-277. https://doi.org/10.1016/j.ins.2017.10.054. |
Files | Size | Format | View | Description |
---|---|---|---|---|
distance (1).pdf | 309.6Kb | [PDF] | View/ | |
This item appears in the following collection(s)
This document is protected by intellectual and industrial property rights. Without prejudice to existing legal exemptions, its reproduction, distribution, public communication or transformation is prohibited without the authorization of the rights holder, unless otherwise indicated.