Central Library

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

000 -LEADER
fixed length control field 05003nam a22006135i 4500
001 - CONTROL NUMBER
control field 978-3-030-30786-8
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730165740.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 190911s2019 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783030307868
-- 978-3-030-30786-8
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-030-30786-8
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA71-90
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBKS
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT041000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBKS
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518
Edition number 23
245 10 - TITLE STATEMENT
Title Graph-Theoretic Concepts in Computer Science
Medium [electronic resource] :
Remainder of title 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers /
Statement of responsibility, etc. edited by Ignasi Sau, Dimitrios M. Thilikos.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2019.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Cham :
Name of producer, publisher, distributor, manufacturer Springer International Publishing :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2019.
300 ## - PHYSICAL DESCRIPTION
Extent XXI, 394 p. 304 illus., 41 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 Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 11789
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Logic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac's condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs.
520 ## - SUMMARY, ETC.
Summary, etc. This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics
General subdivision Data processing.
9 (RLIN) 19904
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 Discrete mathematics.
9 (RLIN) 12873
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence
General subdivision Data processing.
9 (RLIN) 21787
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 arithmetic and logic units.
9 (RLIN) 36750
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational Mathematics and Numerical Analysis.
9 (RLIN) 31598
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 Data Science.
9 (RLIN) 34092
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Arithmetic and Logic Structures.
9 (RLIN) 36752
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sau, Ignasi.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 90510
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Thilikos, Dimitrios M.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 90511
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 90512
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783030307851
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783030307875
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 11789
9 (RLIN) 90513
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-030-30786-8">https://doi.org/10.1007/978-3-030-30786-8</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.