Name
Abstract | ||
|---|---|---|
Solving real-world optimization problems frequently boils down to processing graphs. The graphs themselves are used to represent and structure relationships of the problem’s components. In this chapter we
review external-memory (EM) graph algorithms for a few representative problems:
|
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-36574-5_4 | ALGORITHMS FOR MEMORY HIERARCHIES: ADVANCED LECTURES |
Keywords | Field | DocType |
external memory,optimization problem | Adjacency list,Strength of a graph,Distance-hereditary graph,Theoretical computer science,Null graph,Clique-width,Voltage graph,Moral graph,Graph (abstract data type),Mathematics | Conference |
Volume | ISSN | Citations |
2625 | 0302-9743 | 17 |
PageRank | References | Authors |
0.91 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Irit Katriel | 1 | 176 | 13.72 |
| ulrich meyer | 2 | 57 | 9.50 |
| peter sanders | 3 | 361 | 29.35 |
| Jop F. Sibeyn | 4 | 583 | 60.47 |