Directed Graph Minors and Serial-Parallel Width.

Argyrios Deligkas Reshef Meir

Published in: MFCS (2018)

Keyphrases

directed graph
random walk
graph structure
maximum flow
undirected graph
graph properties
directed acyclic graph
shortest path problem
directed edges
strongly connected
graph structures
parallel processing
edge weights
parallel computing
parallel implementation
shared memory
special case
machine learning