Resistance distances in directed graphs: Definitions, properties, and applications

Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact that various realistic networks are directed. Although several generalizations of resistance distance on directed graphs have been proposed,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1009; S. 114700
Hauptverfasser:	Zhu, Mingzhe, Zhu, Liwang, Li, Huan, Li, Wei, Zhang, Zhongzhi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 12.09.2024
Schlagworte:	Combinatorial optimization problem Directed graphs Random walks Resistance distance Spectral graph theory Resistance distance Random walks Directed graphs Spectral graph theory Combinatorial optimization problem
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!