Central Library

Graph-Theoretic Concepts in Computer Science (Record no. 96252)

000 -LEADER
fixed length control field 04622nam a22006135i 4500
001 - CONTROL NUMBER
control field 978-3-031-43380-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730200824.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230922s2023 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783031433801
-- 978-3-031-43380-1
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-031-43380-1
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA297.4
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT008000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.1
Edition number 23
245 10 - TITLE STATEMENT
Title Graph-Theoretic Concepts in Computer Science
Medium [electronic resource] :
Remainder of title 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers /
Statement of responsibility, etc. edited by Daniël Paulusma, Bernard Ries.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2023.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Cham :
Name of producer, publisher, distributor, manufacturer Springer Nature Switzerland :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2023.
300 ## - PHYSICAL DESCRIPTION
Extent XIII, 478 p. 84 illus., 53 illus. in color.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume/sequential designation 14093
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc. 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics.
9 (RLIN) 12873
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer graphics.
9 (RLIN) 4088
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Numerical analysis.
9 (RLIN) 4603
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics.
9 (RLIN) 12873
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Design and Analysis of Algorithms.
9 (RLIN) 31835
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Graphics.
9 (RLIN) 4088
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Numerical Analysis.
9 (RLIN) 4603
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Symbolic and Algebraic Manipulation.
9 (RLIN) 55589
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Paulusma, Daniël.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 164992
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ries, Bernard.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 164993
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 164994
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783031433795
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783031433818
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume/sequential designation 14093
9 (RLIN) 23263
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-031-43380-1">https://doi.org/10.1007/978-3-031-43380-1</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.