단행본 상세

서지주요정보
Graph-Theoretic Concepts in Computer Science: 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers
서명 / 저자 Graph-Theoretic Concepts in Computer Science [electronic resource] : 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers / edited by Daniël Paulusma, Bernard Ries.
저자명 Paulusma, Daniël. editor. (orcid)0000-0001-5945-9287 https://orcid.org/0000-0001-5945-9287 edt http://id.loc.gov/vocabulary/relators/edt ; Ries, Bernard. editor. (orcid)0000-0003-4395-5547 https://orcid.org/0000-0003-4395-5547 edt http://id.loc.gov/vocabulary/relators/edt
단체명 SpringerLink (Online service)
판사항 1st ed. 2023.
발행사항 Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
총서명 Lecture Notes in Computer Science, 1611-3349 ; 14093
Online Access https://doi.org/10.1007/978-3-... URL

서지기타정보

서지기타정보
ISBN 9783031433801
기타 표준번호 10.1007/978-3-031-43380-1
청구기호 QA297.4
형태사항 XIII, 478 p. 84 illus., 53 illus. in color. online resource.
언어 English
내용 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.
주제 Discrete mathematics.
Computer science --Mathematics.
Algorithms.
Computer graphics.
Numerical analysis.
Discrete Mathematics.
Discrete Mathematics in Computer Science.
Design and Analysis of Algorithms.
Computer Graphics.
Numerical Analysis.
Symbolic and Algebraic Manipulation.
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9783031433795 Printed edition: 9783031433818
QR CODE