A New Notion of Effective Resistance for Directed Graphs - Part II: Computing Resistances.
George Forrest YoungLuca ScardoviNaomi Ehrich LeonardPublished in: IEEE Trans. Autom. Control. (2016)
Keyphrases
- directed graph
- random walk
- databases
- reinforcement learning
- cost effective
- disjoint paths
- maximum flow
- integrated circuit
- directed acyclic graph
- efficient algorithms for computing
- belief revision
- pattern mining
- computationally efficient
- information extraction
- upper bound
- case study
- information retrieval
- neural network