000 | 04553nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-030-86838-3 | ||
003 | DE-He213 | ||
005 | 20240423125353.0 | ||
007 | cr nn 008mamaa | ||
008 | 210919s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030868383 _9978-3-030-86838-3 |
||
024 | 7 |
_a10.1007/978-3-030-86838-3 _2doi |
|
050 | 4 | _aQA71-90 | |
072 | 7 |
_aPBKS _2bicssc |
|
072 | 7 |
_aMAT041000 _2bisacsh |
|
072 | 7 |
_aPBKS _2thema |
|
082 | 0 | 4 |
_a518 _223 |
245 | 1 | 0 |
_aGraph-Theoretic Concepts in Computer Science _h[electronic resource] : _b47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers / _cedited by Łukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aXIII, 404 p. 130 illus., 35 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 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12911 |
|
505 | 0 | _aPreprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance -- On Fair Covering and Hitting Problems -- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem -- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More -- Disjoint Stable Matchings in Linear Time -- Complementation in T-perfect Graphs -- On subgraph complementation to H-free graphs -- Odd Cycle Transversal in Mixed Graphs -- Preventing Small $(s, t)$-Cuts by Protecting Edges -- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel -- A heuristic approach to the treedepth decomposition problem for large graphs -- The Perfect Matching Cut Problem Revisited -- The Complexity of Gerrymandering Over Graphs: Paths and Trees -- Feedback Vertex Set on Hamiltonian Graphs -- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality -- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms -- Linearizable special cases of the quadratic shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG -- On Morphing 1-Planar Drawings -- Bears with Hats and Independence Polynomials -- The Largest Connected Subgraph Game -- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries -- Beyond Helly graphs: the diameter problem on absolute retracts -- Acyclic, Star, and Injective Colouring: Bounding the Diameter -- The Graphs of Stably Matchable Pairs -- On additive spanners in weighted graphs with local error -- Labeling Schemes for Deterministic Radio Multi-Broadcast -- On 3-Coloring of (2P_4, C_5)-Free Graphs. | |
520 | _aChapter “Bears with Hats and Independence Polynomials” is are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. Chapters 1, 6, and 22 are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. | ||
650 | 0 |
_aMathematics _xData processing. |
|
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aComputational Mathematics and Numerical Analysis. |
650 | 2 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aDesign and Analysis of Algorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aKowalik, Łukasz. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPilipczuk, Michał. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRzążewski, Paweł. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030868376 |
776 | 0 | 8 |
_iPrinted edition: _z9783030868390 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v12911 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-86838-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c177209 _d177209 |