Planar graphs : theory and algorithms /
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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Language Notes: | English. |
| Published: |
Amsterdam ; New York : New York, N.Y., U.S.A. :
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1988.
|
| Series: | North-Holland mathematics studies ;
140. Annals of discrete mathematics ; 32. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Internet
Connect to the full text of this electronic bookAvailable Online
| Call Number: |
QA166 .N57 1988eb |
|
|---|---|---|
| Call Number | Status | Get It |
| QA166 .N57 1988eb | Available | |