Simple path with unique labels. How to solve?

Revision en1, by kirjuri, 2023-04-05 17:56:42

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?

Tags graphs, paths, unique elements

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English kirjuri 2023-04-05 17:56:42 246 Initial revision (published)