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,...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1009; s. 114700
Hlavní autori:	Zhu, Mingzhe, Zhu, Liwang, Li, Huan, Li, Wei, Zhang, Zhongzhi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 12.09.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!