rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Graph-Theoretic Concepts in Computer Science
    sub title: 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers
  name:
    name part: Paulusma, Daniël.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Ries, Bernard.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: sz
    date issued: 2023
    edition: 1st ed. 2023.
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (XIII, 478 pages 84 illustrations, 53 illustrations in color.)
  abstract: 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.
  table of contents: 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.
  note: edited by Daniël Paulusma, Bernard Ries.
  subject:
    topic: Discrete mathematics
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Algorithms
  subject:
    topic: Computer graphics
  subject:
    topic: Numerical analysis
  subject:
    topic: Discrete Mathematics
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Design and Analysis of Algorithms
  subject:
    topic: Computer Graphics
  subject:
    topic: Numerical Analysis
  subject:
    topic: Symbolic and Algebraic Manipulation
  classification: QA297.4
  classification: 511.1
  related item:
    title info:
      title: Springer Nature eBook
  related item:
    title info:
      title: Lecture Notes in Computer Science, 14093
  identifier: 9783031433801
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record creation date: 230922
    record change date: 20240810175722.0
    record identifier: in00004819986