The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

GRASP- Greedy randomized adaptive search program

Greedy randomized adaptive search (GRASP) heuristics for finding the largest planar subgraph of a graph have been implemented by Ribeiro and Resende as Algorithm 797 of the Collected Algorithms of the ACM
  • Download Files (local site)
  • Offical Site

    Problem Links

    Feedback Edge/Vertex Set (9)
    Independent Set (8)
    Planarity Detection and Embedding (8)

    This page last modified on 2008-07-10 .