<?xml version="1.0" encoding="UTF-8"?>
<metadata
  xmlns="http://example.org/myapp/"
  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
  xsi:schemaLocation="http://example.org/myapp/ http://example.org/myapp/schema.xsd"
  xmlns:dc="http://purl.org/dc/elements/1.1/"
  xmlns:dcterms="http://purl.org/dc/terms/"><dc:Title>Graph partitioning / edited by Charles-Edmond Bichot, Patrick Siarry. [electronic resource]</dc:Title>
<dc:Creator>Bichot, Charles-Edmond.</dc:Creator>
<dc:Creator>Siarry, Patrick.</dc:Creator>
<dc:Subject>Partitions (Mathematics)</dc:Subject>
<dc:Subject>Graph theory.</dc:Subject>
<dc:Subject>QA76.165 .G73 2011eb</dc:Subject>
<dc:Subject>512.7/3 23</dc:Subject>
<dc:Description>Includes bibliographical references and index.</dc:Description>
<dc:Description>Print version record.</dc:Description>
<dc:Description>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.</dc:Description>
<dc:Publisher>London : ISTE ; Hoboken, NJ : Wiley,</dc:Publisher>
<dc:Date>2011.</dc:Date>
<dc:Date>2011.</dc:Date>
<dc:Date>2011</dc:Date>
<dc:Type>Text</dc:Type>
<dc:Format>1 online resource (xv, 368 pages) :</dc:Format>
<dc:Identifier>http://onlinelibrary.wiley.com/book/10.1002/9781118601181</dc:Identifier>
<dc:Language>eng</dc:Language>
<dc:Relation>Graph partitioning.</dc:Relation>
<dc:Relation>Graph partitioning.</dc:Relation>

</metadata>