000 03781nam a22006255i 4500
001 978-3-319-12340-0
003 DE-He213
005 20240730183840.0
007 cr nn 008mamaa
008 141020s2014 sz | s |||| 0|eng d
020 _a9783319123400
_9978-3-319-12340-0
024 7 _a10.1007/978-3-319-12340-0
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aGraph-Theoretic Concepts in Computer Science
_h[electronic resource] :
_b40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers /
_cedited by Dieter Kratsch, Ioan Todinca.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXI, 422 p. 81 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v8747
505 0 _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.
520 _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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aGeometry.
_921224
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aGeometry.
_921224
700 1 _aKratsch, Dieter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9133714
700 1 _aTodinca, Ioan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9133715
710 2 _aSpringerLink (Online service)
_9133716
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319123394
776 0 8 _iPrinted edition:
_z9783319123417
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v8747
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-319-12340-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92082
_d92082