//]]>

Algorithms and Complexity (Record no. 12940)

000 -LEADER
fixed length control field 04636nam a22005415i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144049.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
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
912 ## -
-- ZDB-2-SCS
-- ZDB-2-LNC
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Calamoneri, Tiziana.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
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 Tiziana Calamoneri, Josep Diaz.
300 ## - PHYSICAL DESCRIPTION
Extent XI, 384p.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/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 Parameterized Route 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.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 7th International Conference on Algorithms and Computation, CIAC 2010, held in Rome, Italy, in May 2010. The 30 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 114 submissions. Among the topics addressed are graph algorithms I, computational complexity, graph coloring, tree algorithms and tree decompositions, computational geometry, game theory, graph algorithms II, and string algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Computer Communication Networks.
Topical term or geographic name as entry element Data structures (Computer science).
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Electronic data processing.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Computer graphics.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Data Structures.
Topical term or geographic name as entry element Numeric Computing.
Topical term or geographic name as entry element Computer Graphics.
Topical term or geographic name as entry element Computer Communication Networks.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Diaz, Josep.
Relator term editor.
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 9783642130724
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-13073-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-03-27AUM Main Library2014-03-27 2014-03-27 E-Book   AUM Main Library005.1
Languages: 
English |
العربية