UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Stream graphs and link streams for the modeling of interactions over time

Social network analysis and mining, 2018-12, Vol.8 (1), p.61-61:29, Article 61

2018

Volltextzugriff (PDF)

Computing Communities in Large Networks Using Random Walks

Computer and Information Sciences - ISCIS 2005, 2005, p.284-293

2005

Volltextzugriff (PDF)

Computing Communities in Large Networks Using Random Walks

Journal of graph algorithms and applications, 2006, Vol.10 (2), p.191-218

2006

Volltextzugriff (PDF)

Spreading dynamics in a cattle trade network: Size, speed, typical profile and consequences on epidemic control strategies

PloS one, 2019-06, Vol.14 (6), p.e0217972-e0217972

2019

Volltextzugriff (PDF)

Basic notions for the analysis of large two-mode networks

Social networks, 2008, Vol.30 (1), p.31-48

2008

Volltextzugriff (PDF)

Main-memory triangle computations for very large (sparse (power-law)) graphs

Theoretical computer science, 2008-11, Vol.407 (1), p.458-473

Latapy, Matthieu

2008

Volltextzugriff (PDF)

Do you trade with your friends or become friends with your trading partners? A case study in the Ğ1 cryptocurrency

Applied network science, 2020-12, Vol.5 (1)

2020

Volltextzugriff (PDF)

Post-processing hierarchical community structures: Quality improvements and multi-scale view

Theoretical computer science, 2011-03, Vol.412 (8), p.892-900

2011

Volltextzugriff (PDF)

The role of bipartite structure in R&D collaboration networks

Journal of complex networks, 2020-08, Vol.8 (4)

2020

Volltextzugriff (PDF)

Closure coefficients in scale-free complex networks

Journal of complex networks, 2020-06, Vol.8 (3)

2020

Volltextzugriff (PDF)

Stronger trust and privacy in social networks via local cooperation1

Journal of complex networks, 2020-10, Vol.8 (4)

2020

Volltextzugriff (PDF)

A local updating algorithm for personalized PageRank via Chebyshev polynomials

Social network analysis and mining, 2022-12, Vol.12 (1), p.31, Article 31

2022

Volltextzugriff (PDF)

Fast computation of empirically tight bounds for the diameter of massive graphs

The ACM journal of experimental algorithmics, 2009-02, Vol.13

2009

Volltextzugriff (PDF)

Computing maximal cliques in link streams

Theoretical computer science, 2016-01, Vol.609 (Part 1), p.245-252

2016

Volltextzugriff (PDF)

The connectivity of graphs of graphs with self-loops and a given degree sequence

Journal of complex networks, 2018-12, Vol.6 (6), p.927-947

2018

Volltextzugriff (PDF)

Towards a bipartite graph modeling of the internet topology

Computer networks (Amsterdam, Netherlands : 1999), 2013-08, Vol.57 (11), p.2331-2347

2013

Volltextzugriff (PDF)

Trends in Social Network Analysis: Information Propagation, User Behavior Modeling, Forecasting, and Vulnerability Assessment

1, 2017

Volltextzugriff (PDF)

Computing Betweenness Centrality in Link Streams

Journal of graph algorithms and applications, 2023-05, Vol.27 (3), p.195-217

2023

Volltextzugriff (PDF)

Do you trade with your friends or become friends with your trading partners? A case study in the $\breve {G}1$ cryptocurrency

Applied network science, 2020-12, Vol.5 (1), Article 25

2020

Volltextzugriff (PDF)

Link streams: Methods and applications

Computer networks (Amsterdam, Netherlands : 1999), 2019-02, Vol.150, p.263-265

2019

Volltextzugriff (PDF)

Do you trade with your friends or become friends with your trading partners? A case study in the Ğ 1 $\breve {G}1$ cryptocurrency

Applied network science, 2020-06, Vol.5 (1), p.1-18

2020

Volltextzugriff (PDF)

Mapping Low-Resolution Edges to High-Resolution Paths: The Case of Traffic Measurements in Cities

Complex Networks XV, 2024, p.1-13

2024

Volltextzugriff (PDF)

Efficient and simple generation of random simple connected graphs with prescribed degree sequence

Journal of complex networks, 2016-03, Vol.4 (1), p.15-37

2016

Volltextzugriff (PDF)

Enumerating maximal cliques in link streams with durations

Information processing letters, 2018-05, Vol.133, p.44-48

2018

Volltextzugriff (PDF)

Bipartite graphs as models of complex networks

Physica A, 2006-11, Vol.371 (2), p.795-813

2006

Volltextzugriff (PDF)

1 – 25 von 145

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(85)
Mit Volltextzugriff
(132)

Publikationsform

Sprache

Englisch
(136)
Französisch
(9)

Erscheinungsjahr

n.n

Thema

Computer Science
(94)
Science & Technology
(75)
Technology
(58)
Networking And Internet Architecture
(32)
Computer Science, Information Systems
(29)
Computer Science, Theory & Methods
(29)
Exact Sciences And Technology
(27)
Social And Information Networks
(26)
Mathematics
(24)
Internet
(22)
Applied Sciences
(21)
Physical Sciences
(20)
Social Sciences
(19)
Telecommunications
(18)
Artificial Intelligence
(16)
Complex Networks
(16)
Computer Science; Control Theory; Systems
(16)
Data Mining
(16)
Graphs
(14)
Engineering
(13)

15 weitere anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Stream graphs and link streams for the modeling of interactions over time

Computing Communities in Large Networks Using Random Walks

Computing Communities in Large Networks Using Random Walks

Spreading dynamics in a cattle trade network: Size, speed, typical profile and consequences on epidemic control strategies

Basic notions for the analysis of large two-mode networks

Main-memory triangle computations for very large (sparse (power-law)) graphs

Do you trade with your friends or become friends with your trading partners? A case study in the Ğ1 cryptocurrency

Post-processing hierarchical community structures: Quality improvements and multi-scale view

The role of bipartite structure in R&D collaboration networks

Closure coefficients in scale-free complex networks

Stronger trust and privacy in social networks via local cooperation1

A local updating algorithm for personalized PageRank via Chebyshev polynomials

Fast computation of empirically tight bounds for the diameter of massive graphs

Computing maximal cliques in link streams

The connectivity of graphs of graphs with self-loops and a given degree sequence

Towards a bipartite graph modeling of the internet topology

Trends in Social Network Analysis: Information Propagation, User Behavior Modeling, Forecasting, and Vulnerability Assessment

Computing Betweenness Centrality in Link Streams

Do you trade with your friends or become friends with your trading partners? A case study in the $\breve {G}1$ cryptocurrency

Link streams: Methods and applications

Do you trade with your friends or become friends with your trading partners? A case study in the Ğ 1 $\breve {G}1$ cryptocurrency

Mapping Low-Resolution Edges to High-Resolution Paths: The Case of Traffic Measurements in Cities

Efficient and simple generation of random simple connected graphs with prescribed degree sequence

Enumerating maximal cliques in link streams with durations

Bipartite graphs as models of complex networks

Suchergebnisse filtern