Counting orientations of graphs with no strongly connected tournaments.

Fábio Botler Carlos Hoppen Guilherme Oliveira Mota

Published in: CoRR (2021)

Keyphrases

strongly connected
directed graph
undirected graph
optimum path forest
special case
np complete
orientation estimation