T nishizeki (51 resultados)

Condición: New.

Condición: 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.

PAPERBACK. Condición: New. 048646671X New. Retail 15.95.

Paperback. Condición: New.

Paperback or Softback. Condición: New. Planar Graphs: Theory and Algorithms. Book.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: 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.…

Paperback. Condición: New.

Condición: New.

Paperback. Condición: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Condición: New. pp. viii + 232 Illus.

Condición: New. pp. viii + 232.

Condición: New.

Condición: As New. Unread book in perfect condition.

Softcover. Condición: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 SAI 9783540107040 Sprache: Englisch Gewicht in Gramm: 550.…

Softcover. Condición: Good. 1st Edition. 216 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 108]. Buch.

Condición: New.

Paperback. Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: As New. Unread book in perfect condition.

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

1. Aufl. 15,5 x 23,5 cm. XI, 510 S., zahlr. Abb. Originalbroschur. Deckel mit Gebrauchsspuren. Seitlich und unten unaufgeschnitten. (Lecture Notes in Computer Science. 650.) Auf Grund der EPR-Regelung können wir in folgende Länder NICHT mehr liefern: Bulgarien, Dänemark, Griechenland, Luxemburg, Österreich, Polen, Rumänien, Schweden, Slowakei, Spanien. …

Paperback. Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- 'Dualities' in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design.…

Paperback. Condición: Brand New. 246 pages. 9.13x5.98x0.79 inches. In Stock.

Condición: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design.…

Taschenbuch. Condición: Neu. Graph Theory and Algorithms | 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings | N. Saito (u. a.) | Taschenbuch | viii | Englisch | 1981 | Springer | EAN 9783540107040 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Paperback. Condición: Very Good. Used Very Good -Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.