Atnaujinkite slapukų nuostatas

Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 2325, 2021, Revised Selected Papers 1st ed. 2021 [Minkštas viršelis]

Edited by , Edited by , Edited by
  • Formatas: Paperback / softback, 404 pages, aukštis x plotis: 235x155 mm, weight: 640 g, 35 Illustrations, color; 95 Illustrations, black and white; XIII, 404 p. 130 illus., 35 illus. in color., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 12911
  • Išleidimo metai: 20-Sep-2021
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030868370
  • ISBN-13: 9783030868376
Kitos knygos pagal šią temą:
Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 2325, 2021, Revised Selected Papers 1st ed. 2021Didesnis paveikslėlis
  • Formatas: Paperback / softback, 404 pages, aukštis x plotis: 235x155 mm, weight: 640 g, 35 Illustrations, color; 95 Illustrations, black and white; XIII, 404 p. 130 illus., 35 illus. in color., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 12911
  • Išleidimo metai: 20-Sep-2021
  • Leidėjas: Springer Nature Switzerland AG
  • ISBN-10: 3030868370
  • ISBN-13: 9783030868376
Kitos knygos pagal šią temą:
Pastovi nuoroda: https://www.kriso.lt/db/9783030868376.html
Raktažodžiai:
This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 2325, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online event due to the COVID-19 pandemic.  The 30 full papers included in this volume were carefully reviewed and selected from 73 submissions. The conference 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. Chapter 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.
Preprocessing 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.