An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.PE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Meeting times on graphs in near-cubic time
An algorithm exploits the near-Sylvester structure of meeting time equations to compute all pairwise expected meeting times on graphs in O(N^4) operations.