kirjuri's blog

By kirjuri, history, 21 month(s) ago, In English

Given an undirected graph with integer edge labels and two nodes u and v, is it possible to calculate efficiently whether there's a simple path between u and v such that all labels are unique?

  • Vote: I like it
  • 0
  • Vote: I do not like it