The ß-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring the domination in directed networks. The present paper characterizes the ranking induced by the ß-measure. It also provides an alternative characterization of the ß-measure
<p>The top-ranked vertices in two networks based on different centrality measures.</p
Given a set of people and a set of events they attend, we ad-dress the problem of measuring connecte...
In this paper we provide an axiomatization of the Shapley value restricted to the class of apex game...
The β-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring...
Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications...
In network theory, Pearson's correlation coefficients are most commonly used to measure the degree a...
In this paper, a new measurement in directed networks is proposed. Our measurement provides an evalu...
A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we a...
Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications...
Weights and directionality of the edges carry a large part of the information we can extract from a ...
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this pa...
In this study, we explore the depth measures for flow hierarchy in directed networks. Two simple mea...
The article of record as published may be found at http://dx.doi.org/10.1007/s11238-007-9077-8A symm...
In this paper, we define novel graph measures for directed networks. The measures are based on graph...
A symmetric network consists of a set of positions and a set of bilateral links between these positi...
<p>The top-ranked vertices in two networks based on different centrality measures.</p
Given a set of people and a set of events they attend, we ad-dress the problem of measuring connecte...
In this paper we provide an axiomatization of the Shapley value restricted to the class of apex game...
The β-measure has been introduced and characterized by van den Brink and Gilles (2000) for measuring...
Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications...
In network theory, Pearson's correlation coefficients are most commonly used to measure the degree a...
In this paper, a new measurement in directed networks is proposed. Our measurement provides an evalu...
A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we a...
Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications...
Weights and directionality of the edges carry a large part of the information we can extract from a ...
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this pa...
In this study, we explore the depth measures for flow hierarchy in directed networks. Two simple mea...
The article of record as published may be found at http://dx.doi.org/10.1007/s11238-007-9077-8A symm...
In this paper, we define novel graph measures for directed networks. The measures are based on graph...
A symmetric network consists of a set of positions and a set of bilateral links between these positi...
<p>The top-ranked vertices in two networks based on different centrality measures.</p
Given a set of people and a set of events they attend, we ad-dress the problem of measuring connecte...
In this paper we provide an axiomatization of the Shapley value restricted to the class of apex game...
DOI
Add to ORKG