LEADER 04439nam  22007695  450 
001 9910483847003321
005 20200702052431.0
010   $a3-319-12340-8
024 7 $a10.1007/978-3-319-12340-0
035   $a(CKB)3710000000269698
035   $a(SSID)ssj0001372644
035   $a(PQKBManifestationID)11761808
035   $a(PQKBTitleCode)TC0001372644
035   $a(PQKBWorkID)11310799
035   $a(PQKB)10964829
035   $a(DE-He213)978-3-319-12340-0
035   $a(MiAaPQ)EBC6302742
035   $a(MiAaPQ)EBC5587847
035   $a(Au-PeEL)EBL5587847
035   $a(OCoLC)895040308
035   $a(PPN)182097862
035   $a(EXLCZ)993710000000269698
100   $a20141020d2014      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aGraph-Theoretic Concepts in Computer Science $e40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers /$fedited by Dieter Kratsch, Ioan Todinca
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (XI, 422 p. 81 illus.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v8747
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-319-12339-4 
320   $aIncludes bibliographical references and index.
327   $aDesign 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v8747
606   $aComputer science?Mathematics
606   $aAlgorithms
606   $aData structures (Computer science)
606   $aGeometry
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017
606   $aGeometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21006
606   $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018
615  0$aComputer science?Mathematics.
615  0$aAlgorithms.
615  0$aData structures (Computer science).
615  0$aGeometry.
615 14$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aData Structures.
615 24$aGeometry.
615 24$aAlgorithms.
676   $a511.5
702   $aKratsch$b Dieter$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aTodinca$b Ioan$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910483847003321
996   $aGraph-Theoretic Concepts in Computer Science$92569248
997   $aUNINA