000 01845nam a2200385Ia 4500
001 0000083751
005 20171002054222.0
006 m o u
007 cr cn|||||||||
008 130710s2004 nyua sb 001 0 eng d
010 _z 2003047258
020 _z0511187904
020 _z0521832683
035 _a(CaPaEBR)ebr10124735
035 _a(OCoLC)560090892
040 _aCaPaEBR
_cCaPaEBR
050 1 4 _aQA402.5
_b.H375 2004eb
082 0 4 _a519.6/4
_222
100 1 _aHarper, Lawrence H.
_q(Lawrence Hueston),
_d1938-
245 1 0 _aGlobal methods for combinatorial isoperimetric problems
_h[electronic resource] /
_cL.H. Harper.
260 _aNew York :
_bCambridge University Press,
_c2004.
300 _axiv, 232 p. :
_bill.
490 1 _aCambridge studies in advanced mathematics ;
_v90
504 _aIncludes bibliographical references and index.
505 0 _a1. The edge-isoperimetric problem -- 2. The minimum path problem -- 3. Stabilization and compression -- 4. The vertex-isoperimetric problem -- 5. Stronger stabilization -- 6. Higher compression -- 7. Isoperimetric problems on infinite graphs -- 8. Isoperimetric problems on complexes -- 9. Morphisms for MWI problems -- 10. Passage to the limit -- App. The classical isoperimetric problem.
533 _aElectronic reproduction.
_bPalo Alto, Calif. :
_cebrary,
_d2013.
_nAvailable via World Wide Web.
_nAccess may be limited to ebrary affiliated libraries.
650 0 _aCombinatorial optimization.
650 0 _aCalculus of variations.
650 0 _aMorphisms (Mathematics)
655 7 _aElectronic books.
_2local
710 2 _aebrary, Inc.
830 0 _aCambridge studies in advanced mathematics ;
_v90.
856 4 0 _uhttp://site.ebrary.com/lib/daystar/Doc?id=10124735
_zAn electronic book accessible through the World Wide Web; click to view
908 _a170314
942 0 0 _cEB
999 _c72908
_d72908