|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 12 keywords
|
|
|
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
60 | Burkhard Monien, Stefan Schamberger |
Graph Partitioning with the Party Library: Helpful-Sets in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBAC-PAD ![In: 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2004), 27-29 October 2004, Foz do Iguacu, Brazil, pp. 198-205, 2004, IEEE Computer Society, 0-7695-2240-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Heuristic Graph Partitioning, Helpful-Sets, Recursive bisection |
44 | Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner |
A parallel local-search algorithm for the k-partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 41-50, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
parallel local-search algorithm, k-partitioning problem, helpful sets, abstraction technique, runtime dynamic graph shrinking, MIMD systems, parallel algorithms, computational complexity, graph theory, heuristics, search problems, computation times, heuristic programming, stochastic methods, parallel efficiency, graph bisection, solution quality, processor numbers |
24 | Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner |
Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Algorithms Appl. ![In: Parallel Algorithms Appl. 8(1), pp. 61-84, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Ralf Diekmann, Burkhard Monien, Robert Preis |
Using helpful sets to improve graph bisections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Interconnection Networks and Mapping and Scheduling Parallel Computations ![In: Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994, pp. 57-73, 1994, DIMACS/AMS, 978-0-8218-0238-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|