Skip to search formSkip to main contentSkip to account menu

Centrality

Known as: Eigenvector centrality measure, Eigenvector+centrality, Closeness 
In graph theory and network analysis, indicators of centrality identify the most important vertices within a graph. Applications include identifying… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Transmitting video content over Vehicular Ad Hoc Networks (VANETs) faces a great number of challenges caused by strict QoS… 
2010
2010
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by… 
2004
2004
This paper investigates the use of the ρ-correlation as a measure for classifier diversity to aid in the choice of classifiers… 
1999
1999
Traditional theories construe approximate truth or truthlikeness as a measure of closeness to facts, singular facts, and… 
1998
1998
Highly charged fluorinated monodisperse spherical particles of diameters between 50 and 250 nm were synthesized from 1H,1H… 
1995
1995
This paper introduces a new framework for modeling and solving dynamic fleet management problems, which we call the Logistics… 
1990
1990
We propose a knowledge representation and operators for large, diverse model libraries. The knowledge representation… 
1984
1984
Architectures, algorithms, and applications for systolic processors are described with attention to the realization of parallel… 
1979
1979
A new class of discrete stationary noisy channels with memory and anticipation termed d-continuous channels is introduced and is…