|
|
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. |
SBAC-PAD |
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. |
HICSS (2) |
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. |
Parallel Algorithms Appl. |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Ralf Diekmann, Burkhard Monien, Robert Preis |
Using helpful sets to improve graph bisections. |
Interconnection Networks and Mapping and Scheduling Parallel Computations |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|