VLSI Planarization: Methods, Models, Implementation: Mathematics and Its Applications, cartea 399
Autor V.Z. Feinberg, A.G. Levin, E.B. Rabinovichen Limba Engleză Hardback – 30 apr 1997
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 617.28 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 13 oct 2012 | 617.28 lei 6-8 săpt. | |
Hardback (1) | 623.34 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 30 apr 1997 | 623.34 lei 6-8 săpt. |
Din seria Mathematics and Its Applications
- Preț: 228.74 lei
- 18% Preț: 918.48 lei
- 15% Preț: 629.85 lei
- 15% Preț: 633.31 lei
- 15% Preț: 574.68 lei
- Preț: 383.06 lei
- 18% Preț: 928.14 lei
- 15% Preț: 570.05 lei
- 5% Preț: 636.42 lei
- 15% Preț: 639.84 lei
- 15% Preț: 629.99 lei
- 15% Preț: 587.53 lei
- Preț: 383.65 lei
- 15% Preț: 633.17 lei
- Preț: 374.75 lei
- Preț: 383.26 lei
- 15% Preț: 686.07 lei
- Preț: 379.88 lei
- Preț: 378.62 lei
- 15% Preț: 568.30 lei
- 15% Preț: 635.25 lei
- 15% Preț: 570.22 lei
- 20% Preț: 577.41 lei
- Preț: 384.22 lei
- 15% Preț: 584.65 lei
- 15% Preț: 577.51 lei
- 15% Preț: 633.17 lei
- 15% Preț: 630.48 lei
- Preț: 381.05 lei
- 15% Preț: 630.48 lei
- 15% Preț: 625.05 lei
- Preț: 378.41 lei
Preț: 623.34 lei
Preț vechi: 733.34 lei
-15% Nou
Puncte Express: 935
Preț estimativ în valută:
119.29€ • 125.46$ • 99.37£
119.29€ • 125.46$ • 99.37£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792345107
ISBN-10: 079234510X
Pagini: 192
Ilustrații: VI, 186 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.45 kg
Ediția:1997
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
ISBN-10: 079234510X
Pagini: 192
Ilustrații: VI, 186 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.45 kg
Ediția:1997
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
1 Discrete Mathematics Fundamentals.- 1.1 Graphs And Hypergraphs.- 1.2 Algorithms And Their Complexity.- 1.3 Algorithms In Graphs.- 1.4 Intractable Problems.- 2 Graph Planarization.- 2.1 Planar Graphs. Graph Planarity Criteria.- 2.2 Graph Planarity Testing Algorithms.- 2.3 Approximation Algorithm for Graph Planarization.- 3 Hypergraph Planarization.- 3.1 The Concept of Planar Hypergraph.- 3.2 Planarity of Different Hypergraph Classes.- 3.3 Hypergraph Nonplanarity Measures. Statement of Hypergraph Planarization Problem.- 3.4 Decomposition Methods of Hypergraph Planarization.- 4 Mathematical Models for VLSI Planarization Problem.- 4.1 Graph versus Hypergraph VLSI Models.- 4.2 VLSI Models with Specified Element Models.- 4.3 Dynamic VLSI Models.- 5 Extracting a Maximum Planar VLSI Part.- 5.1 Extracting a Maximum Planar VLSI Part as a Hypergraph Planarization Problem.- 5.2 Iteration Algorithm for Hypergraph Planarization.- 5.3 Hypergraph Planarization by Konig Representation.- 5.4 Operations of Local Embedding Optimization.- 6 Constructing Nonplanar Connections.- 6.1 Graph Model for Nonplanar Connections.- 6.2 Constructing a Nonplanar Connection as a Steiner Problem in a Weighted Graph.- 6.3 Ordering Nonplanar Connections to be Constructed.- 7 Planarization System Structure.- 7.1 Purpose and Functions of the System.- 7.2 Planarization System Structure. Logic Diagram.- 7.3 Data Organization in Planarization System.- 7.4 Some Aspects of the Practical Use of the Planarization System.- References.
Recenzii
`Altogether, the book is very well written and a good piece of work. All the notions are clearly defined and the proofs are presented in detail. Many pictures illustrate the subjects discussed and help to make things clear and understandable.'
Mathematical Reviews, 98m
Mathematical Reviews, 98m