A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths.
Ngo Dac TanPublished in: Discuss. Math. Graph Theory (2023)
Keyphrases
- directed graph
- undirected graph
- equivalence classes
- minimum length
- pairwise
- artificial intelligence
- multiscale
- decomposition method
- minimum cost
- square error
- minimum weight
- global minimum
- spanning tree
- bipartite graph
- probabilistic model
- cost function
- evolutionary algorithm
- multi agent systems
- search algorithm
- objective function
- database systems
- decision making