The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.
Thomas BellittoShaohua LiKarolina OkrasaMarcin PilipczukManuel SorgePublished in: CoRR (2020)
Keyphrases
- weighted graph
- decision problems
- graph theoretic
- undirected graph
- graph matching
- edge detection
- graph structures
- complex structures
- graph structure
- graph theory
- neural network
- topological information
- computational issues
- polynomial time complexity
- minimum spanning trees
- subgraph isomorphism
- maximum independent set
- random graphs
- directed graph
- connected components
- shortest path
- optimization problems
- computational complexity