
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Computing and Combinatorics: 6th Annual International Conference, COCOON 2000 Sydney, Australia, July 26–28, 2000 Proceedings Author: Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma Published by Springer Berlin Heidelberg ISBN: 978-3-540-67787-1 DOI: 10.1007/3-540-44968-X 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 Stored ISBN-13: 9783540677871 | Stored ISBN-10: 3540677879
This volume presents cutting-edge research from the 6th Annual International Conference on Computing and Combinatorics (COCOON 2000). The conference proceedings cover a wide array of theoretical and applied problems at the intersection of computer science and combinatorics. Topics range from internet-related theoretical challenges and algorithm approximation techniques to graph theory, computational complexity, and data structures. The papers showcase advancements in areas such as network algorithms, discrete optimization, and theoretical computer science.
As a collection of academic conference proceedings, the reception of 'Computing and Combinatorics: COCOON 2000' is primarily within the research community. The papers presented likely reflect the state-of-the-art in their respective fields at the time of publication. The inclusion of diverse topics such as internet algorithms, factorization, graph theory, and computational complexity suggests a broad appeal to researchers and advanced students in theoretical computer science and discrete mathematics. The detailed table of contents indicates a focus on rigorous theoretical contributions and algorithmic advancements.
Page Count:
478
Publication Date:
2000-01-01
ISBN-10:
3540677879
ISBN-13:
9783540677871
No comments yet. Be the first to share your thoughts!