Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I was reading, and thought back to a game I used to play,
which is close to being covered by part (c) of "Metatheorem 2" on page 4 of that paper.
(The difference is that the game's version of toll roads only charge for the first passage.)

What is the computational complexity of the following problem:

For a graph $G$ whose vertices have non-negative integer weights, for vertices $s$ and $t$, is there a
path from $s$ to $t$ such that the sum of the weights of the vertices (including $s$) reached at any given point along it is always greater than the number of distinct edges traversed to get to that point?
(The vertices are not counted with multiplicity either.)

share|cite|improve this question
I am aware of; I asked here because I think $\hspace{2.2 in}$ this question is too low level for that site. $\:$ – Ricky Demer Jan 11 '13 at 7:27
But there is now... – ˈjuː.zɚ79365 Jun 25 '13 at 11:19

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.