Complex networks and link streams for the empirical analysis of large software

DOI10.1007/978-3-319-07734-5_3MaRDI QIDQ5166755zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On some recent advances in complex software networks: modeling, analysis, evolution and applications
• COMPLEX DEPENDENCIES IN LARGE SOFTWARE SYSTEMS
• Multi-granularity evolution analysis of software using complex network theory
• AN INVESTIGATION OF MERGING AND COLLAPSING OF SOFTWARE NETWORKS
• Computing maximal cliques in link streams

Cites work

• Complex networks and link streams for the empirical analysis of large software
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• On some recent advances in complex software networks: modeling, analysis, evolution and applications

Cited in

(4)

• A pair of coupling metrics for software networks
• Temporal interval cliques and independent sets
• Complex networks and link streams for the empirical analysis of large software
• AN INVESTIGATION OF MERGING AND COLLAPSING OF SOFTWARE NETWORKS

This page was built for publication: Complex networks and link streams for the empirical analysis of large software

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166755)