Login / Signup
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.
Thomas Bellitto
Shaohua Li
Karolina Okrasa
Marcin Pilipczuk
Manuel Sorge
Published in:
ISAAC (2020)
Keyphrases
</>
weighted graph
polynomial time complexity
undirected graph
graph matching
np complete
directed graph
graph theory
graph theoretic
series parallel
pattern recognition
graph mining
minimum spanning trees
decision problems
spanning tree
application domains
random graphs
objective function
multiscale
neural network