A breadth-first search with betweenness

MaRDI QIDQ3110085zbMATH OpenFDO

Authors Yoshihiro Kaneko

Publication date 26 January 2012

zbMATH Keywords

betweenness in breadth-first searchnetwork congestionwireless communication networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 6096696
• Betweenness centrality profiles in trees
• Graph-Theoretic Concepts in Computer Science
• Betweenness centrality in some classes of graphs
• scientific article; zbMATH DE number 2170478

Cited in

(2)

• Semi-dynamic breadth-first search in digraphs
• scientific article; zbMATH DE number 5734730 (Why is no real title available?)

This page was built for publication: A breadth-first search with betweenness

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