|
|
|
|
| LEADER |
02915nmm a2200349 u 4500 |
| 001 |
EB000709306 |
| 003 |
EBX01000000000000000562388 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783709190760
|
| 100 |
1 |
|
|a Tinhofer, Gottfried
|e [editor]
|
| 245 |
0 |
0 |
|a Computational Graph Theory
|h Elektronische Ressource
|c edited by Gottfried Tinhofer, Ernst Mayr, Hartmut Noltemeier, Maciej M. Syslo
|
| 250 |
|
|
|a 1st ed. 1990
|
| 260 |
|
|
|a Vienna
|b Springer Vienna
|c 1990, 1990
|
| 300 |
|
|
|a VII, 282 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Combinatorics
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Numerical analysis
|
| 653 |
|
|
|a Numerical Analysis
|
| 653 |
|
|
|a Combinatorics
|
| 700 |
1 |
|
|a Mayr, Ernst
|e [editor]
|
| 700 |
1 |
|
|a Noltemeier, Hartmut
|e [editor]
|
| 700 |
1 |
|
|a Syslo, Maciej M.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Computing Supplementa
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-7091-9076-0?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 006.6
|
| 520 |
|
|
|a One ofthe most important aspects in research fields where mathematics is "applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using graph theoretical concepts
|