Concordance-based Kendall’s correlation for computationally-light vs. computationally-heavy centrality metrics: lower bound for correlation
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2196-8896
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Concordance-based Kendall’s correlation for computationally-light vs. computationally-heavy centrality metrics: lower bound for correlation ; day:28 ; month:6 ; year:2017 ; pages:1-23
Vietnam journal of computer science ; (28.6.2017), 1-23
- Urheber
-
Meghanathan, Natarajan
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s40595-017-0097-1
- URN
-
urn:nbn:de:1111-201709228861
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Meghanathan, Natarajan
- SpringerLink (Online service)
Ähnliche Objekte (12)
A computationally lightweight and localized centrality metric in lieu of betweenness centrality for complex network analysis
Computationally secure information flow
Computationally secure information flow
Rectangle Covers Revisited Computationally
Computationally efficient flux variability analysis
Computationally tractable classes of ordered sets
Computationally intensive Value at Risk calculations
Moral responsibility for computationally designed products
Computationally Supported Inversion of Ketoreductase Stereoselectivity
Minimizing finite automata is computationally hard
Exploiting structure in computationally hard voting problems
Computationally efficient design of directionally compliant metamaterials
A computationally lightweight and localized centrality metric in lieu of betweenness centrality for complex network analysis
Computationally secure information flow
Computationally secure information flow
Rectangle Covers Revisited Computationally
Computationally efficient flux variability analysis
Computationally tractable classes of ordered sets
Computationally intensive Value at Risk calculations
Moral responsibility for computationally designed products
Computationally Supported Inversion of Ketoreductase Stereoselectivity
Minimizing finite automata is computationally hard
Exploiting structure in computationally hard voting problems
Computationally efficient design of directionally compliant metamaterials
A computationally lightweight and localized centrality metric in lieu of betweenness centrality for complex network analysis
Computationally secure information flow
Computationally secure information flow
Rectangle Covers Revisited Computationally
Computationally efficient flux variability analysis
Computationally tractable classes of ordered sets
Computationally intensive Value at Risk calculations
Moral responsibility for computationally designed products
Computationally Supported Inversion of Ketoreductase Stereoselectivity
Minimizing finite automata is computationally hard
Exploiting structure in computationally hard voting problems