Cargando…
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...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
North-Holland
1988
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/1990801 |