Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph-Theoretic Concepts in Computer Science: 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers de Daniël Paulusma

Graph-Theoretic Concepts in Computer Science: 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers: Lecture Notes in Computer Science, cartea 14093

Editat de Daniël Paulusma, Bernard Ries
en Limba Engleză Paperback – 23 sep 2023
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 47100 lei

Preț vechi: 55412 lei
-15% Nou

Puncte Express: 707
Preț estimativ în valută:
9017€ • 9373$ • 7476£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031433795
ISBN-10: 3031433793
Pagini: 478
Ilustrații: XIII, 478 p. 84 illus., 53 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.69 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.