Login / Signup

Counting orientations of graphs with no strongly connected tournaments.

Fábio BotlerCarlos HoppenGuilherme Oliveira Mota
Published in: LAGOS (2021)
Keyphrases
  • strongly connected
  • directed graph
  • undirected graph
  • optimum path forest
  • random walk
  • objective function
  • upper bound
  • graph mining