Further results on the expected hitting time, the cover cost and the related invariants of graphs.

Jing Huang Shuchao Li Zheng Xie

Published in: Discret. Math. (2019)

Keyphrases

high cost
social networks
closely related
graph representation
neural network
feature vectors
graph matching
graph mining
graph databases
graph theoretic
expected cost
graph clustering
cost savings
finding the shortest path