"Théorie des graphes." . . "Algorytmy." . . "Grafs, Teoria dels." . . "vertex." . . "Algoritmus." . . "Algorithmes." . . "théorie graphe." . . "Gráfelmélet." . . "algorithmique." . . "Planarer Graph." . . . . "Grafs, Teoria de." . . "Discrete wiskunde." . . "Nishizeki, T." . . "Graph theory." . . "Grafos, Teoría de." . . "Teoria grafów." . . "cycle hamiltonien." . . "Algorithms." . . "Algoritmos." . . "MATHEMATICS Graphic Methods." . . "flot graphe." . . "Teoría de grafos." . . . . . . . . . . . "Planar Graphs Theory and Algorithms. North-Holland Mathematics Studies, Volume 140: Annals of Discrete Mathematics, Volume 32"@en . . . . . . . . . . . . . . . . . "Llibres electrònics" . . "Planar graphs theory and algorithms"@en . "Planar graphs theory and algorithms" . . . . . . . "Planar Graphs Theory and Algorithms"@en . . . . "Electronic resource"@en . . . "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 chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- o."@en . "Electronic books"@en . "Electronic books" . . . "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 chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included."@en . "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 chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included." . . . . . . . . . . . . . . . . . . . . . . . "Planar graphs: theory and algorithms" . "Planar graphs : theory and algorithms" . "Planar graphs : theory and algorithms"@en . . "Planar graphs: theory and algoritms" . . "graphe planaire." . . "coloration graphe." . . "Graphentheorie." . . "algorithme." . . "Graphes, Théorie des." . . "Graphes, théorie des." .