Graph-Theoretic Concepts in Computer Science : 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers / / edited by Łukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski

• Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
• Edizione: 1st ed. 2021.
• Descrizione fisica: 1 online resource (417 pages)
• Disciplina: 511.5
• Soggetto topico: Mathematics - Data processing; Data structures (Computer science); Information theory; Algorithms; Computer science - Mathematics; Discrete mathematics; Computational Mathematics and Numerical Analysis; Data Structures and Information Theory; Design and Analysis of Algorithms; Discrete Mathematics in Computer Science
• Persona (resp. second.): KowalikŁukasz; PilipczukMichał; RzążewskiPaweł
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Sommario/riassunto: 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.
• Titolo autorizzato: Graph-Theoretic Concepts in Computer Science
• ISBN: 3-030-86838-9
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910502645303321
• Lo trovi qui: Univ. Federico II
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 12911