Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results.

Published in: Graphs Comb. (2024)

Keyphrases

weighted graph
worst case
undirected graph
pspace complete
decision problems
connected components
computational cost
parallel processing
graph structure
graph theoretic
topological information
strongly connected
polynomial time complexity
minimum spanning trees