Learning centrality by learning to route

DOI10.1007/978-3-030-93409-5_21MaRDI QIDQ2086595zbMATH OpenOpenAlexFDO

Authors Liav Bachar, Aviad Elyashar, Rami Puzis

Publication date 25 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93409-5_21

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Routing betweenness centrality
• Centrality measures in networks
• Measuring centrality by a generalization of degree
• A centrality notion for graphs based on Tukey depth
• STACS 2005

Cites work

• A faster algorithm for betweenness centrality*
• Geometrical embeddings of graphs
• Laplacian centrality: A new centrality measure for weighted networks
• Network centrality: an introduction
• Routing betweenness centrality

Describes a project that uses

Uses Software

• SciPy

This page was built for publication: Learning centrality by learning to route

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