Complexity results for two kinds of colored disconnections of graphs.

You Chen Ping Li Xueliang Li Yindi Weng

Published in: J. Comb. Optim. (2021)

Keyphrases

space complexity
worst case
real time
graph theory
graph representation
machine learning
pairwise
computational cost
upper bound
graph matching
undirected graph
complexity analysis
graph theoretic
series parallel