|
" Computational graph theory "
G. Tinhofer ... (eds.).
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
767734
|
| Doc. No
|
:
|
b587718
|
| Main Entry
|
:
|
G. Tinhofer ... (eds.).
|
| Title & Author
|
:
|
Computational graph theory\ G. Tinhofer ... (eds.).
|
| Publication Statement
|
:
|
Wien ; New York: Springer., ©1990, cop. 1990 :
|
| Series Statement
|
:
|
Computing., Supplementum ;, 7.
|
| Page. NO
|
:
|
282 s. : illustrations.
|
| ISBN
|
:
|
0387821775
|
|
|
:
|
: 3211821775
|
|
|
:
|
: 9780387821771
|
|
|
:
|
: 9783211821770
|
| Contents
|
:
|
Efficient Computations in Tree-Like Graphs.- Graph Problems Related to Gate Matrix Layout and PLA Folding.- Planar Graph Problems.- Basic Parallel Algorithms in Graph Theory.- Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs.- Orders and Graphs.- Dynamic Partial Orders and Generalized Heaps.- Communication Complexity.- Path Problems in Graphs.- Heuristics for Graph Coloring.- Probabilistic Analysis of Graph Algorithms.- Generating Graphs Uniformly at Random.- Embedding one Interconnection Network in Another.
|
| Subject
|
:
|
Datorgrafi.
|
| LC Classification
|
:
|
QA166.G756 9999
|
| Added Entry
|
:
|
G Tinhofer
|
| |