Login / Signup

Finding maximum subgraphs with relatively large vertex connectivity.

Alexander VeremyevOleg A. ProkopyevVladimir BoginskiEduardo L. Pasiliao
Published in: Eur. J. Oper. Res. (2014)
Keyphrases
  • strongly connected
  • connected subgraphs
  • labeled graphs
  • data structure
  • topological information
  • case study
  • lower bound
  • directed graph
  • graph databases