//]]>

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

000 -LEADER
fixed length control field 04285nam a22005415i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144047.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 100301s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642114090
978-3-642-11409-0
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.M35 
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
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 Paul, Christophe.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Graph-Theoretic Concepts in Computer Science
Medium [electronic resource] :
Remainder of title 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers /
Statement of responsibility, etc edited by Christophe Paul, Michel Habib.
300 ## - PHYSICAL DESCRIPTION
Extent XIII, 353p. 59 illus.
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 5911
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.
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 Data structures (Computer science).
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Algebra
General subdivision Data processing.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Geometry.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Geometry.
Topical term or geographic name as entry element Algorithms.
Topical term or geographic name as entry element Symbolic and Algebraic Manipulation.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Data Structures.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Habib, Michel.
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 9783642114083
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-11409-0
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 Library004.0151

Languages: 
English |
العربية