000			03161cam a2200553Ia 4500
001			ocn316566717
003			OCoLC
005			20141103172227.0
006			m o d
007			cr cn|||||||||
008			090320s1988 ne a ob 001 0 eng d
040			_aOPELS _beng _cOPELS _dOPELS _dOCLCQ _dOCLCF _dOCLCO _dDEBBG
020			_a9780444702128
020			_a0444702121
029	1		_aNZ1 _b15193167
029	1		_aDEBBG _bBV036962624
029	1		_aDEBSZ _b407392440
035			_a(OCoLC)316566717
037			_a119914:123042 _bElsevier Science & Technology _nhttp://www.sciencedirect.com
050		4	_aQA166 _b.N57 1988eb
082	0	4	_a511/.5 _222
049			_aTEFA
100	1		_aNishizeki, T. _q(Takao), _d1947-
245	1	0	_aPlanar graphs _h[electronic resource] : _btheory and algorithms / _cT. Nishizeki and N. Chiba.
260			_aAmsterdam ; _aNew York : _bNorth-Holland ; _aNew York, N.Y., U.S.A. : _bSole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., _c1988.
300			_a1 online resource (xii, 232 p.) : _bill.
490	1		_aNorth-Holland mathematics studies ; _v140
490	1		_aAnnals of discrete mathematics ; _v32
520			_aCollected 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.
504			_aIncludes bibliographical references (p. 221-226) and index.
588			_aDescription based on print version record.
650		0	_aGraph theory.
650		0	_aAlgorithms.
650		6	_aGraphes, Th�eorie des.
650		6	_aAlgorithmes.
650		7	_aGraphes, th�eorie des. _2ram
650		7	_aAlgorithmes. _2ram
650		7	_aAlgorithms. _2fast _0(OCoLC)fst00805020
650		7	_aGraph theory. _2fast _0(OCoLC)fst00946584
655		4	_aElectronic books.
700	1		_aChiba, N. _q(Norishige)
776	0	8	_iPrint version: _aNishizeki, T. (Takao), 1947- _tPlanar graphs. _dAmsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1988 _z0444702121 _z9780444702128 _w(DLC) 88004980 _w(OCoLC)17649731
830		0	_aNorth-Holland mathematics studies ; _v140.
830		0	_aAnnals of discrete mathematics ; _v32.
856	4	0	_3ScienceDirect _uhttp://www.sciencedirect.com/science/book/9780444702128
856	4		_uhttp://www.sciencedirect.com/science/publication?issn=03040208&volume=140 _3Volltext
942			_cEB
994			_aC0 _bTEF
999			_c21918 _d21918