Combinatorial Algorithms (Record no. 97689)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05835nam a22006735i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-642-10217-2 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730204039.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 | 100301s2009 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642102172 |
| -- | 978-3-642-10217-2 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-10217-2 |
| 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 | Combinatorial Algorithms |
| Medium | [electronic resource] : |
| Remainder of title | 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28--July 2, 2009, Revised Selected Papers / |
| Statement of responsibility, etc. | edited by Jiri Fiala, Jan Kratochvil, Mirka Miller. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2009. |
| 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 | 2009. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XII, 480 p. |
| 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 | |
| Source | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume/sequential designation | 5874 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Invited Talks -- Branching Systems -- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology -- Succinct Representations of Trees -- Kt Minors in Large t-Connected Graphs -- Intractability in Graph Drawing and Geometry: FPT Approaches -- Contributed Talks -- Evaluation of Recoverable-Robust Timetables on Tree Networks -- Weighted LCS -- Integrality Properties of Certain Special Balanceable Families -- Forbidden Subgraph Colorings and the Oriented Chromatic Number -- Polynomial Kernels for 3-Leaf Power Graph Modification Problems -- Approximating the Max Edge-Coloring Problem -- Three Complexity Results on Coloring P k -Free Graphs -- Fully Decomposable Split Graphs -- Feedback Vertex Set on Graphs of Low Cliquewidth -- Note on Decomposition of K n,n into (0,j)-prisms -- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids -- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search -- LPF Computation Revisited -- Limiting Distribution for Distances in k-Trees -- Gray Code Compression -- Embedded Trees and the Support of the ISE -- Combinatorial Models for Cooperation Networks -- Polar Permutation Graphs -- A New Algorithm for Efficient Pattern Matching with Swaps -- The Height and Range of Watermelons without Wall -- Fast Convolutions and Their Applications in Approximate String Matching -- Better Polynomial Algorithms on Graphs of Bounded Rank-Width -- Minimax Trees in Linear Time with Applications -- Planar Biconnectivity Augmentation with Fixed Embedding -- Trivially-Perfect Width -- Lightweight Parameterized Suffix Array Construction -- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices -- Factorizations of Complete Graphs into Spanning Trees with All Possible MaximumDegrees -- On the Maximal Number of Cubic Subwords in a String -- Solution of Peter Winkler's Pizza Problem -- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs -- Simpler Parameterized Algorithm for OCT -- Bipartite Graphs of Large Clique-Width -- Kernel in Oriented Circulant Graphs -- Randomized Postoptimization of Covering Arrays -- New Word-Based Adaptive Dense Compressors -- Rainbow Connection in Graphs with Minimum Degree Three -- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree -- Computability of Width of Submodular Partition Functions -- The Guarding Problem - Complexity and Approximation -- Antibandwidth of d-Dimensional Meshes. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics. |
| 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 | Machine theory. |
| 9 (RLIN) | 177963 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Coding theory. |
| 9 (RLIN) | 4154 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Information theory. |
| 9 (RLIN) | 14256 |
| 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 | Discrete Mathematics. |
| 9 (RLIN) | 12873 |
| 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 | Formal Languages and Automata Theory. |
| 9 (RLIN) | 177964 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Coding and Information Theory. |
| 9 (RLIN) | 177965 |
| 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 | Fiala, Jiri. |
| Relator term | editor. |
| Relationship | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 9 (RLIN) | 177966 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Kratochvil, Jan. |
| Relator term | editor. |
| Relationship | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 9 (RLIN) | 177967 |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Miller, Mirka. |
| Relator term | editor. |
| Relationship | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 9 (RLIN) | 177968 |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 9 (RLIN) | 177969 |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783642102165 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Printed edition: |
| International Standard Book Number | 9783642102189 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Theoretical Computer Science and General Issues, |
| International Standard Serial Number | 2512-2029 ; |
| Volume/sequential designation | 5874 |
| 9 (RLIN) | 177970 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-3-642-10217-2">https://doi.org/10.1007/978-3-642-10217-2</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.