Isbn: 9780486466712 - planar graphs: theory and algorithms (dover books on mathematics) (19 Ergebnisse)

Zustand: New.

PAPERBACK. Zustand: New. 048646671X New. Retail 15.95.

Paperback. Zustand: New.

Paperback or Softback. Zustand: New. Planar Graphs: Theory and Algorithms. Book.

Zustand: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books.

Zustand: As New. Unread book in perfect condition.

Paperback. Zustand: new. Paperback. This text features most of the important theorems and algorithms for planar graphs. Topics include planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multi-commodity flows. Suitable as a textbook, it is also useful for researchers. 1988 edition. This text features most of the important theorems and algorithms for planar graphs. Suitable as a textbook, it is also useful for researchers and includes an extensive reference section. 1988 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Zustand: New.

Paperback. Zustand: New.

Zustand: New.

Paperback. Zustand: New.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Neuware - This text features most of the important theorems and algorithms for planar graphs. Topics include planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multi-commodity flows. Suitable as a textbook, it is also useful for researchers. 1988 edition.…

Paperback. Zustand: New.

Zustand: New. InhaltsverzeichnisrnrnAcknowledgmentsnPrefacen1. Graph Theoretic Foundationsn2. Algorithmic Foundationsn3. Planarity Testing and Embeddingn4. Drawing Planar Graphsn5. Vertex-Coloringn6. Edge-Coloringn7. Independent Vertex Setsn8. Listing Subgrap.

Paperback. Zustand: New.

Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Paperback. Zustand: new. Paperback. This book features most of the important theorems and algorithms related to planar graphs. Eminently suitable as a text, it also is useful for researchers and includes an extensive reference section. The authors, who have researched planar graphs for many years, have structured the topics in a manner relevant to graph theorists and computer scientists. The first two chapters are introductory and provide the foundations of the graph theoretic notions and algorithmic techniques used throughout the text. Succeeding chapters discuss planarity testing and embedding, drawing planar graphs, vertex- and edge-colouring, independent vertex sets, and subgraph listing. The text concludes with explorations of planar separator theorem, Hamiltonian cycles, and single-commodity or multi-commodity flows. This text features most of the important theorems and algorithms for planar graphs. Suitable as a textbook, it is also useful for researchers and includes an extensive reference section. 1988 edition. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. …

Paperback. Zustand: new. Paperback. This text features most of the important theorems and algorithms for planar graphs. Topics include planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multi-commodity flows. Suitable as a textbook, it is also useful for researchers. 1988 edition. This text features most of the important theorems and algorithms for planar graphs. Suitable as a textbook, it is also useful for researchers and includes an extensive reference section. 1988 edition. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…