Complex Networks and Link Streams for the Empirical Analysis of Large Software

DOI10.1007/978-3-319-07734-5_3zbMath1410.68087OpenAlexW122417909MaRDI QIDQ5166755

Matthieu Latapy, Jordan Viard

Publication date: 8 July 2014

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07734-5_3

zbMATH Keywords

complex networksdynamic graphslink streamssoftware traces

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Temporal interval cliques and independent sets ⋮ Complex Networks and Link Streams for the Empirical Analysis of Large Software

Cites Work

• Main-memory triangle computations for very large (sparse (power-law)) graphs
• ON SOME RECENT ADVANCES IN COMPLEX SOFTWARE NETWORKS: MODELING, ANALYSIS, EVOLUTION AND APPLICATIONS
• Complex Networks and Link Streams for the Empirical Analysis of Large Software

This page was built for publication: Complex Networks and Link Streams for the Empirical Analysis of Large Software