Simple path with unique labels. How to solve?

Правка en1, от 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?

Теги graphs, paths, unique elements

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский kirjuri 2023-04-05 17:56:42 246 Initial revision (published)