Graph-Theoretic Concepts in Computer Science by Kowalik, Łukasz; Pilipczuk, Michał; Rzążewski, Paweł;

47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers

Sorozatcím: Lecture Notes in Computer Science; 12911;

20% KEDVEZMÉNY?
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.

Kiadói listaár EUR 90.94
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.

35 521 Ft (33 829 Ft + 5% áfa)
Kedvezmény(ek) 20% (cc. 7 104 Ft off)
Kedvezményes ár 28 416 Ft (27 063 Ft + 5% áfa)
A kedvezmény érvényes eddig: 2026. június 30.

31 258 Ft

Beszerezhetőség

Megrendelésre a kiadó utánnyomja a könyvet. Rendelhető, de a szokásosnál kicsit lassabban érkezik meg.

A termék adatai:

Kiadás sorszáma 1st ed. 2021
Kiadó Springer International Publishing
Megjelenés dátuma 2021. szeptember 20.
Kötetek száma 1 pieces, Book

ISBN 9783030868376
Kötéstípus Puhakötés
Terjedelem404 oldal
Méret 235x155 mm
Súly 640 g
Nyelv angol
Illusztrációk XIII, 404 p. 130 illus., 35 illus. in color. Illustrations, black & white

Kategóriák

Hosszú leírás:

This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23–25, 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.

Több

Tartalomjegyzék:

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.