Login / Signup

Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time.

Christophe CrespelleEric Thierry
Published in: Discret. Math. (2015)
Keyphrases
  • directed graph
  • cartesian product
  • random walk
  • undirected graph
  • graph structure
  • decomposition method
  • directed acyclic graph
  • maximum flow
  • learning algorithm
  • np hard
  • markov chain
  • shortest path problem
  • directed edges