LEADER 02418nam  2200625 a 450 
001 9910141514903321
005 20231102174502.0
010   $a1-118-60118-1
010   $a1-299-14634-1
010   $a1-118-60119-X
010   $a1-118-60125-4
035   $a(CKB)2670000000327422
035   $a(EBL)1117279
035   $a(OCoLC)827208465
035   $a(SSID)ssj0000822006
035   $a(PQKBManifestationID)11432266
035   $a(PQKBTitleCode)TC0000822006
035   $a(PQKBWorkID)10755832
035   $a(PQKB)11286893
035   $a(OCoLC)826657800
035   $a(MiAaPQ)EBC1117279
035   $a(Au-PeEL)EBL1117279
035   $a(CaPaEBR)ebr10653878
035   $a(CaONFJC)MIL445884
035   $a(PPN)183420780
035   $a(EXLCZ)992670000000327422
100   $a20130211d2011      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 00$aGraph partitioning$b[electronic resource] /$fedited by Charles-Edmond Bichot, Patrick Siarry
210  1$aLondon :$cISTE ;$aHoboken, N.J. :$cWiley,$d2011.
215   $a1 online resource (386 pages)
225 0 $aISTE.
300   $aDescription based upon print version of record.
311   $a1-84821-233-X 
320   $aIncludes bibliographical references and index.
327   $apt. 1. Graph partitioning for numerical analysis -- pt. 2. Optimization methods for graph partitioning -- pt. 3. Other approaches to graph partitioning.
330   $aGraph partitioning is a theoretical subject with applications in many areas, principally: numerical analysis, programs mapping onto parallel architectures, image segmentation, VLSI design. During the last 40 years, the literature has strongly increased and big improvements have been made.  This book brings together the knowledge accumulated during many years to extract both theoretical foundations of graph partitioning and its main applications.
606   $aPartitions (Mathematics)
606   $aGraph theory
615  0$aPartitions (Mathematics)
615  0$aGraph theory.
676   $a512.7/3
701   $aBichot$b Charles-Edmond$0963934
701   $aSiarry$b Patrick$0860327
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910141514903321
996   $aGraph partitioning$92185977
997   $aUNINA