Show Student Project Graph Partitioning in The Boost Graph Library for Boost C++ Libraries

• Google Open Source Programs
  • User (self)
    • Sign In
  • Programs
    • GSoC 2009
      • Home
      • Frequently Asked Questions
      • Admin & Mentor Participant Agreement
      • Press Guidelines
      • Student Participant Agreement
      • Student Info
      • Testing Guide
      • Timeline
      • Program Terms of Service
      • User's Guide
      • List participating Organizations
      • Apply to become a Mentor
      • List all student projects

Release 0-5-20091121

Student Name:	Balsa Raicevic
Mentor Name:	Nick Edmonds
Title:	Graph Partitioning in The Boost Graph Library
Abstract:	Graph partitioning is an important problem with extensive application in scientific computing, optimization, VLSI design, and task partitioning for parallel processing. My GSoC project would be to implement several graph partitioning algorithms on the existing BGL graph types, and then, depending on the availability of a hypergraph data structure, either look at partitioning algorithms on hypergraphs, or attempt to implement those partitioning algorithms in The Parallel BGL.