On the Cartesian Sum of Undirected Graphs.
Hanns-Martin TeichertPublished in: J. Inf. Process. Cybern. (1982)
Keyphrases
- undirected graph
- directed acyclic graph
- directed graph
- approximation algorithms
- disjoint paths
- complex networks
- connected components
- spanning tree
- graph structure
- objective function
- random graphs
- minimum cost
- positive integer
- multicommodity flow
- vertex set
- strongly connected
- average degree
- random walk
- multi dimensional