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á bibliografie

Vydáno v:	Theoretical computer science Ročník 1009; s. 114700
Hlavní autoři:	Zhu, Mingzhe, Zhu, Liwang, Li, Huan, Li, Wei, Zhang, Zhongzhi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 12.09.2024
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!