Algorithms and Complexity (Record no. 93459)

000 -LEADER
fixed length control field 04696nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-642-13073-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730190817.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 100510s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642130731
-- 978-3-642-13073-1
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-13073-1
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.6-76.66
072 #7 - SUBJECT CATEGORY CODE
Subject category code UM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UM
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.11
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms and Complexity
Medium [electronic resource] :
Remainder of title 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings /
Statement of responsibility, etc. edited by Josep Diaz, Tiziana Calamoneri.
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 XI, 384 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 PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 6078
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- Towards a Distributed Search Engine -- Mechanisms for the Marriage and the Assignment Game -- Resilient Algorithms and Data Structures -- Session 1. Graph Algorithms I -- An Exact Algorithm for Connected Red-Blue Dominating Set -- Maximizing PageRank with New Backlinks -- Enumerating Rooted Graphs with Reflectional Block Structures -- Improved Approximations for TSP with Simple Precedence Constraints -- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number -- Session 2. Computational Complexity -- Parameterized Complexity of Even/Odd Subgraph Problems -- Popular Matchings in the Marriage and Roommates Problems -- Bounding the Number of Tolerable Faults in Majority-Based Systems -- A Parameterized Algorithm for Chordal Sandwich -- Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown -- Session 3. Graph Coloring -- Graph Unique-Maximum and Conflict-Free Colorings -- Strategic Coloring of a Graph -- Session 4. Tree Algorithms and Tree Decompositions -- Multicut Algorithms via Tree Decompositions -- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality -- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights -- A Planar Linear Arboricity Conjecture -- Session 5. Computational Geometry -- On the Number of Higher Order Delaunay Triangulations -- How Simple Robots Benefit from Looking Back -- Session 6. Game Theory -- On Strategy Improvement Algorithms for Simple Stochastic Games -- Online Cooperative Cost Sharing -- Session 7. Graph Algorithms II -- On the Power of Nodes of Degree Four in the Local Max-Cut Problem -- Packing Bipartite Graphs with Covers of Complete Bipartite Graphs -- Irredundant Set Faster Than O(2 n ) -- The Complexity of Computing Minimal Unidirectional Covering Sets -- A ParameterizedRoute to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance -- Session 8. String Algorithms -- Finding the Maximum Suffix with Fewer Comparisons -- An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences -- Session 9. Network Algorithms -- Capacitated Confluent Flows: Complexity and Algorithms -- Preprocessing Speed-Up Techniques Is Hard -- Communication Requirements for Stable Marriages.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer programming.
9 (RLIN) 4169
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 Computer science.
9 (RLIN) 9832
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 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 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Programming Techniques.
9 (RLIN) 143973
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Communication Networks.
9 (RLIN) 143974
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of Computation.
9 (RLIN) 143975
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 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
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Diaz, Josep.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 143976
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Calamoneri, Tiziana.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 143977
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 143978
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642130724
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783642130748
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 6078
9 (RLIN) 143979
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-642-13073-1">https://doi.org/10.1007/978-3-642-13073-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.