001481101 000__ 04575cam\\22005657i\4500
001481101 001__ 1481101
001481101 003__ OCoLC
001481101 005__ 20231031003322.0
001481101 006__ m\\\\\o\\d\\\\\\\\
001481101 007__ cr\cn\nnnunnun
001481101 008__ 230926s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001481101 020__ $$a9783031433801$$q(electronic bk.)
001481101 020__ $$a3031433807$$q(electronic bk.)
001481101 020__ $$z9783031433795
001481101 0247_ $$a10.1007/978-3-031-43380-1$$2doi
001481101 035__ $$aSP(OCoLC)1399537099
001481101 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dWSU
001481101 049__ $$aISEA
001481101 050_4 $$aQA166
001481101 08204 $$a004.01/51$$223/eng/20230926
001481101 1112_ $$aInternational Workshop WG$$n(49th :$$d2023 :$$cFribourg, Switzerland)
001481101 24510 $$aGraph-theoretic concepts in computer science :$$b49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-39, 2023, Revised Selected Papers /$$cDaniël Paulusma, Bernard Ries, editors.
001481101 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2023]
001481101 300__ $$a1 online resource (xiii, 478 pages) :$$billustrations (some color)
001481101 336__ $$atext$$btxt$$2rdacontent
001481101 337__ $$acomputer$$bc$$2rdamedia
001481101 338__ $$aonline resource$$bcr$$2rdacarrier
001481101 4901_ $$aLecture notes in computer science ;$$v14093
001481101 4901_ $$aAdvanced research in computing and software science
001481101 500__ $$aIncludes author index.
001481101 5050_ $$aProportionally 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 Erdős-Pósa 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 -- ai-Metric Graphs: Radius, Diameter and all Eccentricities -- Maximum edge colouring problem on graphs that exclude a xed minor -- Bounds on Functionality and Symmetric Difference -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.
001481101 506__ $$aAccess limited to authorized users.
001481101 520__ $$aThis 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.
001481101 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 26, 2023).
001481101 650_0 $$aGraph theory$$xData processing$$vCongresses.
001481101 650_0 $$aComputer science$$xMathematics$$vCongresses.$$0(DLC)sh2007006411
001481101 655_7 $$aConference papers and proceedings.$$2lcgft
001481101 655_0 $$aElectronic books.
001481101 7001_ $$aPaulusma, Daniël.$$eeditor.
001481101 7001_ $$aRies, Bernard,$$eeditor.
001481101 830_0 $$aLecture notes in computer science ;$$v14093.
001481101 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
001481101 852__ $$bebk
001481101 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-43380-1$$zOnline Access$$91397441.1
001481101 909CO $$ooai:library.usi.edu:1481101$$pGLOBAL_SET
001481101 980__ $$aBIB
001481101 980__ $$aEBOOK
001481101 982__ $$aEbook
001481101 983__ $$aOnline
001481101 994__ $$a92$$bISE