The.boost.graph.library.user.Guide.and.Reference.manual.(2002)
Algorithms for VLSI Physical Design Automation
Benjamin Doerr MPII Saarbrücken joint work with Quasi-Random Rumor Spreading Tobias Friedrich U Berkeley Anna Huber MPII Saarbrücken Thomas Sauerwald U.
OpenNTF Domino API - Overview Introduction
Graph Partitioning Abhiram Ranade IIT Bombay. A load balancing problem Input: – undirected graph G. Vertices = processes. Edges = interprocess communication.
