02714nam 2200745 a 450 991082830850332120240313134203.097811186011811118601181978129914634112991463419781118601198111860119X97811186012591118601254(CKB)2670000000327422(EBL)1117279(OCoLC)827208465(SSID)ssj0000822006(PQKBManifestationID)11432266(PQKBTitleCode)TC0000822006(PQKBWorkID)10755832(PQKB)11286893(OCoLC)826657800(MiAaPQ)EBC1117279(Au-PeEL)EBL1117279(CaPaEBR)ebr10653878(CaONFJC)MIL445884(PPN)183420780(OCoLC)669751134(FINmELB)ELB178706(Perlego)1013383(EXLCZ)99267000000032742220130211d2011 uy 0engur|n|---|||||txtrdacontentcrdamediacrrdacarrierGraph partitioning /edited by Charles-Edmond Bichot, Patrick Siarry1st ed.London ISTE ;Hoboken, N.J. Wiley2011London :ISTE ;Hoboken, N.J. :Wiley,2011.1 online resource (386 pages)ISTE.Description based upon print version of record.9781848212336 184821233X Includes bibliographical references and index.pt. 1. Graph partitioning for numerical analysis -- pt. 2. Optimization methods for graph partitioning -- pt. 3. Other approaches to graph partitioning.Graph 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.Partitions (Mathematics)Graph theoryPartitions (Mathematics)Graph theory.512.7/3Bichot Charles-Edmond1710280Siarry Patrick860327MiAaPQMiAaPQMiAaPQBOOK9910828308503321Graph partitioning4100749UNINA