| 000 | 04699nam a22006615i 4500 | ||
|---|---|---|---|
| 001 | 978-3-030-00256-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240730164403.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 180901s2018 sz | s |||| 0|eng d | ||
| 020 |
_a9783030002565 _9978-3-030-00256-5 |
||
| 024 | 7 |
_a10.1007/978-3-030-00256-5 _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] : _b44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings / _cedited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer. |
| 250 | _a1st ed. 2018. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2018. |
|
| 300 |
_aXIII, 384 p. 102 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 ; _v11159 |
|
| 505 | 0 | _aOn Dispersable Book Embeddings -- Characterising AT-free Graphs with BFS -- Edge Partitions of Optimal 2-plane and 3-plane Graphs -- On Minimum Connecting Transition Sets in Graphs -- Recognizing Hyperelliptic Graphs in Polynomial Time -- On Directed Feedback Vertex Set Parameterized by Treewidth -- Optimality Program in Segment and String Graphs -- Anagram-Free Chromatic Number is Not Pathwidth-Bounded -- Tight Lower Bounds for the Number of st-Cuts -- Sub-exponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity -- Computing Small Pivot-Minors -- Saving Probe Bits by Cube Domination -- Graph Amalgamation under Logical Constraints -- Optimal General Matchings -- Quasimonotone Graphs -- Equiangular Polygon Contact Representations -- Temporal Graph Classes: A View Through Temporal Separators -- Covering A Graph with Nontrivial Vertex-disjoint Paths: Existence and Optimization -- On the Relation of Strong Triadic Closure and Cluster Deletion -- On Perfect Linegraph Squares -- On Weak Isomorphism of Rooted Vertex-Colored Graphs -- Connected Vertex Cover for (sP_1+P_5)-Free Graphs -- Structurally Parameterized d-Scattered Set -- Popular Matchings of Desired Size -- Convexity-Increasing Morphs of Planar Graphs -- Treedepth Bounds in Linear Colorings -- An Improved FPT lgorithm for Independent Feedback Vertex Set -- Construction and Local Routing for Angle-Monotone Graphs -- Characterization and Recognition of Tree 3-Spanner dmissible Directed Path Graphs of Diameter Three. . | |
| 520 | _aThis book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held in Cottbus, Germany, in June 2018. The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising 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 arithmetic and logic units. _936750 |
|
| 650 | 0 |
_aComputer graphics. _94088 |
|
| 650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
| 650 | 2 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aData Science. _934092 |
| 650 | 2 | 4 |
_aArithmetic and Logic Structures. _936752 |
| 650 | 2 | 4 |
_aComputer Graphics. _94088 |
| 700 | 1 |
_aBrandstädt, Andreas. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _984240 |
|
| 700 | 1 |
_aKöhler, Ekkehard. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _984241 |
|
| 700 | 1 |
_aMeer, Klaus. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _984243 |
|
| 710 | 2 |
_aSpringerLink (Online service) _984244 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030002558 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030002572 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11159 _984245 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-00256-5 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c85636 _d85636 |
||