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

000 -LEADER
fixed length control field 05679nam a22006375i 4500
001 - CONTROL NUMBER
control field 978-3-642-16926-7
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730192036.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 101110s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642169267
-- 978-3-642-16926-7
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-16926-7
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.M35
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA297.4
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYAM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYAM
Source thema
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Graph-Theoretic Concepts in Computer Science
Medium [electronic resource] :
Remainder of title 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers /
Statement of responsibility, etc. edited by Dimitrios M. Thilikos.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2010.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2010.
300 ## - PHYSICAL DESCRIPTION
Extent XIII, 338 p. 62 illus.
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 6410
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- Algorithmic Barriers from Phase Transitions in Graphs -- Algorithmic Graph Minors and Bidimensionality -- Regular Talks -- Complexity Results for the Spanning Tree Congestion Problem -- max-cut and Containment Relations in Graphs -- The Longest Path Problem is Polynomial on Cocomparability Graphs -- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds -- On Stable Matchings and Flows -- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs -- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time -- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching -- Efficient Algorithms for Eulerian Extension -- On the Small Cycle Transversal of Planar Graphs -- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective -- Graphs that Admit Right Angle Crossing Drawings -- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs -- On the Boolean-Width of a Graph: Structure and Applications -- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs -- Colouring Vertices of Triangle-Free Graphs -- A Quartic Kernel for Pathwidth-One Vertex Deletion -- Network Exploration by Silent and Oblivious Robots -- Uniform Sampling of Digraphs with a Fixed Degree Sequence -- Measuring Indifference: Unit Interval Vertex Deletion -- Parameterized Complexity of the Arc-Preserving Subsequence Problem -- From Path Graphs to Directed Path Graphs -- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces -- Efficient Broadcasting in Random Power Law Networks -- Graphs with Large Obstacle Numbers -- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree -- The Number of Bits Needed to Represent a Unit Disk Graph -- Lattices and Maximum FlowAlgorithms in Planar Graphs.
520 ## - SUMMARY, ETC.
Summary, etc. The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28-30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japan, The Netherlands, Norway, Poland, Switzerland, the UK, and the USA) attended the conference. WG has a long tradition. Since 1975, WG has taken place 21 times in Germany, four times in The Netherlands, twice in Austria, twice in France and once in the Czech Republic, Greece, Italy, Norway, Slovakia, Switzerland, and the UK. WG aims at merging 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. The goal is to presentemergingresearchresultsand to identify and exploredirections of future research.The conference is well-balanced with respect to established researchers and young scientists. There were 94 submissions, two of which where withdrawn before entering the review process. Each submission was carefully reviewed by at least 3, and on average 4.5, members of the Program Committee. The Committee accepted 28 papers, which makes an acceptance ratio of around 30%. I should stress that, due to the high competition and the limited schedule, there were papers that were not accepted while they deserved to be.
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 Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Geometry.
9 (RLIN) 21224
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer networks .
9 (RLIN) 31572
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence
General subdivision Data processing.
9 (RLIN) 21787
650 14 - 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 Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Geometry.
9 (RLIN) 21224
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Communication Networks.
9 (RLIN) 148376
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data Science.
9 (RLIN) 34092
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) 148377
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 148378
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642169250
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642169274
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 6410
9 (RLIN) 148379
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-16926-7">https://doi.org/10.1007/978-3-642-16926-7</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.