Computing and Combinatorics - Info and Reading Options
6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings
By Ding-Zhu Du, Peter Eades, Xuemin Lin and Arun Sharma
"Computing and Combinatorics" was published by Springer London, Limited in 2003 - Berlin/Heidelberg, it has 478 pages and the language of the book is English.
“Computing and Combinatorics” Metadata:
- Title: Computing and Combinatorics
- Authors: Ding-Zhu DuPeter EadesXuemin LinArun Sharma
- Language: English
- Number of Pages: 478
- Publisher: Springer London, Limited
- Publish Date: 2003
- Publish Location: Berlin/Heidelberg
“Computing and Combinatorics” Subjects and Themes:
- Subjects: ➤ Congresses - Combinatorial analysis - Computer science - Artificial Intelligence (incl. Robotics) - Computer Communication Networks - Computer software - Logic design - Computational complexity - Artificial intelligence - Algorithm Analysis and Problem Complexity - Discrete Mathematics in Computer Science - Computation by Abstract Devices - Logics and Meanings of Programs
Edition Identifiers:
- The Open Library ID: OL34424798M - OL18718265W
- ISBN-13: 9783540449683
- All ISBNs: 9783540449683
AI-generated Review of “Computing and Combinatorics”:
"Computing and Combinatorics" Description:
Open Data:
Lecture Notes in Computer Science -- Computing and Combinatorics -- Copyright -- Preface -- Conference Organization -- Table of Contents -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Approximating Uniform Triangular Meshes in Polygons -- Maximum Induced Matchings of Random Cubic Graphs -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Embedding Problems for Paths with Direction Constrained Edges★ -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties★ -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines★ -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications★ -- Efficient List Ranking Algorithms on Reconfigurable Mesh★ -- Tripods Do Not Pack Densely
Read “Computing and Combinatorics”:
Read “Computing and Combinatorics” by choosing from the options below.
Search for “Computing and Combinatorics” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Computing and Combinatorics” in Libraries Near You:
Read or borrow “Computing and Combinatorics” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Computing and Combinatorics” at a library near you.
Buy “Computing and Combinatorics” online:
Shop for “Computing and Combinatorics” on popular online marketplaces.
- Ebay: New and used books.