Commutativity conditions for groups arising from acyclic directed graphs and posets.

Thomas Bier Imed Zaguia

Published in: Eur. J. Comb. (2011)

Keyphrases

directed graph
random walk
strongly connected
experimental conditions
directed acyclic graph
undirected graph
sufficient conditions
np complete
np hard
graph structure
maximum flow
neural network
database systems
upper bound