Graph-Theoretic Concepts in Computer Science

49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers

AvDaniël Paulusma,Bernard Ries

Häftad, Engelska, 2023

Del 14093 i serien Lecture Notes in Computer Science

865 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023.The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116 submissions. The WG 2022 workshop 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.

Produktinformation

Utgivningsdatum:2023-09-23
Mått:155 x 235 x 27 mm
Vikt:739 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:478
Förlag:Springer International Publishing AG
ISBN:9783031433795

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Innehållsförteckning

Proportionally Fair Matching with Multiple Groups.- Reconstructing Graphs from Connected Triples.- Parameterized Complexity of Vertex Splitting to Pathwidth at most 1.- Odd Chromatic Number of Graph Classes.- Deciding the Erdos-P osa property in 3-connected digraphs.- New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth.- Computational Complexity of Covering Colored Mixed Multigraphswith Degree Partition Equivalence Classes of Size at Most Two.- Cutting Barnette graphs perfectly is hard.- Metric dimension parameterized by treewidth in chordal graphs.- Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs.- Generating faster algorithms for d-Path Vertex Cover.- A new width parameter of graphs based on edge cuts: -edge-crossing width.- Snakes and Ladders: a Treewidth Story.- Parameterized Results on Acyclic Matchings with Implications for Related Problems.- P-matchings Parameterized by Treewidth.- Algorithms and hardness for Metric Dimension on digraphs.- Degreewidth : a New Parameter for Solving Problems on Tournaments.- Approximating Bin Packing with Con ict Graphs via Maximization Techniques.- i-Metric Graphs: Radius, Diameter and all Eccentricities.- Maximum edge colouring problem on graphs that exclude a xed minor.- Bounds on Functionality and Symmetric Di erence { Two Intriguing Graph Parameters.- Cops and Robbers on Multi-layer Graphs.- Parameterized Complexity of Broadcasting in Graphs.- Turan's Theorem Through Algorithmic Lens.- On the Frank number and nowhere-zero ows on graphs.- On the minimum number of arcs in 4-dicritical oriented graphs.- Tight Algorithms for Connectivity Problems Parameterized byModular-Treewidth.