The Collection of
Computer Science Bibliographies

Bibliography on Graph Partitioning

[   About   |  Browse   |   Statistics   ]

Number of references:149Last update:July 27, 2001
Number of online publications:0Supported:no
Most recent reference:2000

in  ;
Publication year: in:, since:, before: (four digit years)
Options: , ,

You may use Lucene syntax, available fields are: ti (title), au (author), yr (publications year).

Information on the Bibliography

Author:
Ulrich Elsner <elsner @ mathematik . tu-chemnitz . de> (email mangled to prevent spamming)
Fakultät für Mathematik
TU Chemnitz
90107 Chemnitz
Germany
Abstract:
This bibliography concerns itself mainly with algorithms that try achieve fast, high quality partitions. In this respect I hope this collection is rather complete. Other aspects of graph partitions, like theoretical paper, algorithms that concentrate on very high quality partitions with little respect to time (like simulated annealing type algorithms) or very fast algorithms with little regard to quality (graph growing, geometric algorithms) do appear in this collection but in these areas it is by no means complete.
Keywords:
graph partitioning, graph bisection

Browsing the bibliography

Bibliographic Statistics

Types:
techreport(55), article(53), inproceedings(28), manual(7), incollection(4), misc(1), phdthesis(1)
Fields:
author(149), title(149), year(147), url(102), number(90), pages(70), volume(61), month(59), institution(55), journal(53), booktitle(32), note(23), address(16), organization(15), editor(14), publisher(14), series(9), type(2), annote(1), school(1)
Distribution of publication dates:
Distribution of publication dates

Valid XHTML 1.1!  Valid CSS!