1.5 Graph Problems -- hard problems

Specific Algorithms

  • 1.5.1 Clique
  • 1.5.2 Independent Set
  • 1.5.3 Vertex Cover
  • 1.5.4 Traveling Salesman Problem
  • 1.5.5 Hamiltonian Cycle
  • 1.5.6 Graph Partition
  • 1.5.7 Vertex Coloring
  • 1.5.8 Edge Coloring
  • 1.5.9 Graph Isomorphism
  • 1.5.10 Steiner Tree
  • 1.5.11 Feedback Edge/Vertex Set

    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .