Difference between revisions of "MSCs2007"
From assela Pathirana
Jump to navigationJump to search
| Line 14: | Line 14: | ||
** http://www.cs.sandia.gov/~bahendr/partitioning.html (See: Alternatives to Standard Graph Partitioning) | ** http://www.cs.sandia.gov/~bahendr/partitioning.html (See: Alternatives to Standard Graph Partitioning) | ||
** '''Weighted graphs''': http://en.wikipedia.org/wiki/Weighted_graph | ** '''Weighted graphs''': http://en.wikipedia.org/wiki/Weighted_graph | ||
*** Weighted graph | *** Weighted graph partitioning: http://www.cs.sunysb.edu/~algorith/files/graph-partition.shtml, | ||
*** METIS is a software for graph partitioning that can do multiple constraint graph partitioning. For example it can implement Minimizing the Total Communication Volume and balancing nodal demands in each partition. (Manual:[[Image:Metis_program_manual_2007.pdf|metis.pdf]]). Can be downloaded from: http://glaros.dtc.umn.edu/gkhome/metis/metis/download | |||
Revision as of 07:51, 4 September 2007
Leakage zone creation and management of leakage
- Max-Flow Min-Cut Animation
- Flow-networks: General article in wikipedia [1]
Water Supply & Drainage Board
- Mr. Sarath Gamini (DGM, Projects, Katugastota)
- Mr. Attanayake (DGM, Central Region, Gatembe office)
Graph Theory
- Graph partioning:
- Beyond GP:
- http://www.cs.sandia.gov/~bahendr/partitioning.html (See: Alternatives to Standard Graph Partitioning)
- Weighted graphs: http://en.wikipedia.org/wiki/Weighted_graph
- Weighted graph partitioning: http://www.cs.sunysb.edu/~algorith/files/graph-partition.shtml,
- METIS is a software for graph partitioning that can do multiple constraint graph partitioning. For example it can implement Minimizing the Total Communication Volume and balancing nodal demands in each partition. (Manual:File:Metis program manual 2007.pdf). Can be downloaded from: http://glaros.dtc.umn.edu/gkhome/metis/metis/download
