| 000 | 04622nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-43380-1 | ||
| 003 | DE-He213 | ||
| 005 | 20240730200824.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 230922s2023 sz | s |||| 0|eng d | ||
| 020 |
_a9783031433801 _9978-3-031-43380-1 |
||
| 024 | 7 |
_a10.1007/978-3-031-43380-1 _2doi |
|
| 050 | 4 | _aQA297.4 | |
| 072 | 7 |
_aPBD _2bicssc |
|
| 072 | 7 |
_aMAT008000 _2bisacsh |
|
| 072 | 7 |
_aPBD _2thema |
|
| 082 | 0 | 4 |
_a511.1 _223 |
| 245 | 1 | 0 |
_aGraph-Theoretic Concepts in Computer Science _h[electronic resource] : _b49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers / _cedited by Daniël Paulusma, Bernard Ries. |
| 250 | _a1st ed. 2023. | ||
| 264 | 1 |
_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2023. |
|
| 300 |
_aXIII, 478 p. 84 illus., 53 illus. in color. _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 ; _v14093 |
|
| 505 | 0 | _aProportionally Fair Matching with Multiple Groups -- Reconstructing Graphs from Connected Triples -- Parameterized Complexity of Vertex Splitting to Pathwidth at most 1 -- Odd Chromatic Number of Graph Classes -- Deciding the Erdos-P osa property in 3-connected digraphs -- New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth -- Computational Complexity of Covering Colored Mixed Multigraphswith Degree Partition Equivalence Classes of Size at Most Two -- Cutting Barnette graphs perfectly is hard -- Metric dimension parameterized by treewidth in chordal graphs -- Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs -- Generating faster algorithms for d-Path Vertex Cover -- A new width parameter of graphs based on edge cuts: -edge-crossing width -- Snakes and Ladders: a Treewidth Story -- Parameterized Results on Acyclic Matchings with Implications for Related Problems -- P-matchings Parameterized by Treewidth -- Algorithms and hardness for Metric Dimension on digraphs -- Degreewidth : a New Parameter for Solving Problems on Tournaments -- Approximating Bin Packing with Con ict Graphs via Maximization Techniques -- i-Metric Graphs: Radius, Diameter and all Eccentricities -- Maximum edge colouring problem on graphs that exclude a xed minor -- Bounds on Functionality and Symmetric Di erence { Two Intriguing Graph Parameters -- Cops and Robbers on Multi-layer Graphs -- Parameterized Complexity of Broadcasting in Graphs -- Turan's Theorem Through Algorithmic Lens -- On the Frank number and nowhere-zero ows on graphs -- On the minimum number of arcs in 4-dicritical oriented graphs -- Tight Algorithms for Connectivity Problems Parameterized byModular-Treewidth. | |
| 520 | _aThis volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023. The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications. | ||
| 650 | 0 |
_aDiscrete mathematics. _912873 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aComputer graphics. _94088 |
|
| 650 | 0 |
_aNumerical analysis. _94603 |
|
| 650 | 1 | 4 |
_aDiscrete Mathematics. _912873 |
| 650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
| 650 | 2 | 4 |
_aDesign and Analysis of Algorithms. _931835 |
| 650 | 2 | 4 |
_aComputer Graphics. _94088 |
| 650 | 2 | 4 |
_aNumerical Analysis. _94603 |
| 650 | 2 | 4 |
_aSymbolic and Algebraic Manipulation. _955589 |
| 700 | 1 |
_aPaulusma, Daniël. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9164992 |
|
| 700 | 1 |
_aRies, Bernard. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9164993 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9164994 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031433795 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031433818 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14093 _923263 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-43380-1 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c96252 _d96252 |
||