PROBLEM SOLVING IN ALGORITHMS A RESEARCH APPROACH
| คงเหลือ | รอคิว | รอ/วัน |
|---|---|---|
| 1/1 | 0 | 0 |
- ประเภท : อีบุ๊ก
- สำนักพิมพ์ : CHIANG MAI UNIVERSITY PRESS
- Author : Sanpawat Kantabutra Faculty of Engineering, CMU
- ISBN :9786163985491
- ภาษา : -
- จำนวนหน้า : 222
- ขนาดไฟล์ : 5.43 MB
This is THE book for every serious researcher in theoretical computer science. The book exposes critical detail in problem solving and researching in the fields of algorithms and complexity that no other book has ever done. It reveals the secrets of doing research and the way of thinking that are so natural to the world’s top computer scientists. Such skills and thinking are so “second nature” to every top computer scientist that they are not even mentioned or talked about. This book is thus for everyone who seriously wants to become an excellent researcher but may not have such skills and thinking.
Chapter 1 Network Embedding 1
1.1 Introduction 1
1.2 CON and its Related Denitions 2
1.3 The Embedding Algorithm 8
1.4 Scaling The Embedded Hypercube 10
1.5 The Analysis 12
1.6 Optimal Scaling 16
1.7 Conclusion 20
1.8 Problem Set 20
Chapter 2 Graph Relabeling 23
2.1 Introduction 24
2.2 Formal Denitions and Notation 26
2.3 Parallel Computation Model and Programming Constructs 28
2.4 Brent's Scheduling Principle 29
2.5 Mapping of the Label Congurations 29
2.6 Graphs Km;m with a Parity Labeling 33
2.7 Graphs Km;m with a Precise Labeling 37
2.8 Conclusion 44
2.9 Problem Set 44
1.1 Introduction 1
1.2 CON and its Related Denitions 2
1.3 The Embedding Algorithm 8
1.4 Scaling The Embedded Hypercube 10
1.5 The Analysis 12
1.6 Optimal Scaling 16
1.7 Conclusion 20
1.8 Problem Set 20
Chapter 2 Graph Relabeling 23
2.1 Introduction 24
2.2 Formal Denitions and Notation 26
2.3 Parallel Computation Model and Programming Constructs 28
2.4 Brent's Scheduling Principle 29
2.5 Mapping of the Label Congurations 29
2.6 Graphs Km;m with a Parity Labeling 33
2.7 Graphs Km;m with a Precise Labeling 37
2.8 Conclusion 44
2.9 Problem Set 44
