Login / Signup

Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs.

Collette R. CoullardAbdur RaisRonald L. RardinDonald K. Wagner
Published in: Networks (1993)
Keyphrases
  • graph theory
  • learning algorithm
  • computationally efficient
  • graph mining
  • maximum clique
  • data structure
  • significant improvement
  • computational cost
  • graph search
  • graph properties
  • graph data