Planar Graphs: Theory and Algorithms

✍ T. Nishizeki and N. Chiba (Eds.) 📂 Library 📅 1988 🏛 Elsevier Science Ltd 🌐 English

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two c

📁 Planar Graphs: Theory and Algorithms

✍ T. Nishizeki and N. Chiba (Eds.) 📂 Library 📅 1988 🏛 Elsevier Science Ltd 🌐 English

I strongly suggest avoiding this book until the authors produce a more readable/useable next edition. Or else just go find an alternative book. The subject matter is quite interesting and useful but the book makes it extremely difficult to learn. For the sake of definiteness I will provide a techni

Algorithmic Graph Theory and Perfect Gra

📁 Algorithmic Graph Theory and Perfect Graphs

✍ Martin Charles Golumbic (Eds.) 📂 Library 📅 2004 🏛 North Holland 🌐 English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra

📁 Algorithmic Graph Theory and Perfect Graphs

✍ Martin Charles Golumbic 📂 Library 📅 1980 🏛 Academic Press 🌐 English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra

📁 Algorithmic Graph Theory and Perfect Graphs

✍ Martin Charles Golumbic (Eds.) 📂 Library 📅 2004 🏛 Elsevier, Academic Press 🌐 English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra

📁 Algorithmic Graph Theory and Perfect Graphs

✍ Martin Charles Golumbic (Eds.) 📂 Library 📅 2004 🏛 Butterworth heineman 🌐 English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Planar Graphs: Theory and Algorithms

✦ Subjects