Graph Theoretic Concepts in Computer Science (Record no. 112879)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04771nam a22005895i 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 | 20140220084550.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 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBD |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYAM |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM018000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | MAT008000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Thilikos, Dimitrios M. |
| Relator term | editor. |
| 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. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 2010. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIII, 338p. 62 illus. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 0302-9743 ; |
| Volume number/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 Flow Algorithms in Planar Graphs. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the thoroughly refereed post-conference proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2010, held in Zarós, Crete, Greece, in June 2010. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 94 initial submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations - as well as applications of graph-theoretic concepts in Computer Science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Communication Networks. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data structures (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer software. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational complexity. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Geometry. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Geometry. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Communication Networks. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Data Structures. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783642169250 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 0302-9743 ; |
| Volume number/sequential designation | 6410 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-642-16926-7 |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.