Pietro Poggi-Corradini

Orcid: 0000-0002-0678-5633

According to our database1, Pietro Poggi-Corradini authored at least 16 papers between 2012 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies.
CoRR, December, 2025

An Exact-Arithmetic Algorithm for Spanning Tree Modulus.
Networks, 2025

Minimizing the Determinant of the Graph Laplacian.
J. Graph Theory, 2025

Modulus for bases of matroids.
Discret. Math., 2025

2024
Models of random spanning trees.
CoRR, 2024

2021
Fairest edge usage and minimum expected overlap for random spanning trees.
Discret. Math., 2021

2020
Spanning tree modulus for secure broadcast games.
Networks, 2020

2019
Designing Optimal Multiplex Networks for Certain Laplacian Spectral Properties.
CoRR, 2019

Identifying Android malware using network-based approaches.
Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019

Identifying Android Malware Using Network-Based Approaches.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
New methods for incorporating network cyclic structures to improve community detection.
CoRR, 2018

2017
Egocentric Effective Conductance Centrality and General Degree.
CoRR, 2017

2016
Generalized network measures based on modulus of families of walks.
J. Comput. Appl. Math., 2016

Modulus of families of loops with applications in network analysis.
CoRR, 2016

2015
Numerical investigation of metrics for epidemic processes on graphs.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2012
Effective resistance on graphs and the Epidemic quasimetric
CoRR, 2012


  Loading...