000 04419nam a22006375i 4500
001 978-3-662-53536-3
003 DE-He213
005 20240730183026.0
007 cr nn 008mamaa
008 160927s2016 gw | s |||| 0|eng d
020 _a9783662535363
_9978-3-662-53536-3
024 7 _a10.1007/978-3-662-53536-3
_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] :
_b42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers /
_cedited by Pinar Heggernes.
250 _a1st ed. 2016.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aX, 307 p. 51 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9941
505 0 _aSequences of radius "k" for complete bipartite graphs -- Approximate Association via Dissociation -- Geodetic convexity parameters for graphs with few short induced paths -- Weighted Ecient Domination for P5-Free and for P6-Free Graphs -- Saving colors and Max Coloring: some xed-parameter tractability results -- Finding Two Edge-Disjoint Paths with Length Constraints -- Packing and covering immersion models of planar subcubic graphs -- The maximum weight stable set problem in (P 6, bull)-free graphs -- Parameterized Power Vertex Cover -- Exhaustive generation of k-critical H-free graphs -- Induced separation dimension -- Tight Bounds for Gomory-Hu-like Cut Counting -- Eccentricity Approximating Trees: Extended Abstract -- Drawing Planar Graphs with Prescribed Face Areas -- Vertex Cover Structural Parameterization Revisited -- Distance-d Independent Set and other problems in graphs with "few" minimal separators -- Parameterized complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds -- On Directed Steiner Trees with Multiple Roots -- A Faster Parameterized Algorithm for Group Feedback Edge Set -- Sequence Hypergraphs -- On subgraphs of bounded degeneracy in hypergraphs.
520 _aThis book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016. The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research. .
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer graphics.
_94088
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 _aComputer Graphics.
_94088
650 2 4 _aGeometry.
_921224
700 1 _aHeggernes, Pinar.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9130138
710 2 _aSpringerLink (Online service)
_9130139
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662535356
776 0 8 _iPrinted edition:
_z9783662535370
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9941
_9130140
856 4 0 _uhttps://doi.org/10.1007/978-3-662-53536-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91624
_d91624