Login / Signup

On minimally 2-T-connected directed graphs.

Olivier Durand de GevigneyZoltán Szigeti
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • directed graph
  • random walk
  • strongly connected
  • graph structure
  • directed acyclic graph
  • connected components
  • maximum flow
  • undirected graph
  • data mining
  • case study
  • machine learning
  • data structure
  • graph mining
  • web graph