• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Finding a feasible flow in a strongly connected network.

Bernhard HaeuplerRobert Endre Tarjan
Published in: Oper. Res. Lett. (2008)
Keyphrases
  • strongly connected
  • directed graph
  • optimum path forest
  • state space
  • graphical models
  • peer to peer
  • flow field
  • social networks
  • network structure
  • network model
  • network architecture
  • undirected graph
  • network management