About this Item
Quantity Available: 1
Title: Planar Graphs: Theory and Algorithms (...
Publisher: Elsevier Science Ltd
Publication Date: 1988
Book Condition: Good
Dust Jacket Condition: Includes dust jacket.
About this title
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.
"About this title" may belong to another edition of this title.
Refunds Offered Within 10 days of order.
Books From California
51 W. Easy St
Simi Valley, CA. 93065
Fax # 805-582-9513
For questions, please email at
Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.
accepted by seller