04439nam 22007695 450 991048384700332120200702052431.03-319-12340-810.1007/978-3-319-12340-0(CKB)3710000000269698(SSID)ssj0001372644(PQKBManifestationID)11761808(PQKBTitleCode)TC0001372644(PQKBWorkID)11310799(PQKB)10964829(DE-He213)978-3-319-12340-0(MiAaPQ)EBC6302742(MiAaPQ)EBC5587847(Au-PeEL)EBL5587847(OCoLC)895040308(PPN)182097862(EXLCZ)99371000000026969820141020d2014 u| 0engurnn#008mamaatxtccrGraph-Theoretic Concepts in Computer Science 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers /edited by Dieter Kratsch, Ioan Todinca1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (XI, 422 p. 81 illus.)Lecture Notes in Computer Science,0302-9743 ;8747Bibliographic Level Mode of Issuance: Monograph3-319-12339-4 Includes bibliographical references and index.Design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Random graphs and models of the web and scale-free networks -- Support of these concepts by suitable implementations and applications.This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014.   The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.Lecture Notes in Computer Science,0302-9743 ;8747Computer science—MathematicsAlgorithmsData structures (Computer science)GeometryDiscrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Geometryhttps://scigraph.springernature.com/ontologies/product-market-codes/M21006Algorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Computer science—Mathematics.Algorithms.Data structures (Computer science).Geometry.Discrete Mathematics in Computer Science.Algorithm Analysis and Problem Complexity.Data Structures.Geometry.Algorithms.511.5Kratsch Dieteredthttp://id.loc.gov/vocabulary/relators/edtTodinca Ioanedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910483847003321Graph-Theoretic Concepts in Computer Science2569248UNINA