Computing and combinatorics : 5th annual international conference, COCOON ’99, Tokyo, Japan, July 26-28, 1999 : proceedings

Computing and Combinatorics: 5th Annual International Conference, COCOON’99 Tokyo, Japan, July 26–28, 1999 Proceedings
Author: Takano Asano, Hideki Imai, D. T. Lee, Shin-ichi Nakano, Takeshi Tokuyama
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66200-6
DOI: 10.1007/3-540-48686-0

Table of Contents:

• The Web as a Graph: Measurements, Models, and Methods
• Some Observations on the Computational Complexity of Graph Accessibility Problem (Extended Abstract)
• An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree
• Theory of 2-3 Heaps
• An External Memory Data Structure for Shortest Path Queries (Extended Abstract)
• Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees
• Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations
• An Approximation Algorithm for the Two-Layered Graph Drawing Problem
• Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
• Layout Problems on Lattice Graphs
• A New Transference Theorem in the Geometry of Numbers
• On Covering and Rank Problems for Boolean Matrices and Their Applications
• A Combinatorial Algorithm for Pfaffians
• How to Swap a Failing Edge of a Single Source Shortest Paths Tree
• On Bounds for the k-Partitioning of Graphs
• A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
• Probabilities to Accept Languages by Quantum Finite Automata
• Distributionally-Hard Languages
• Circuits and Context-Free Languages
• On the Negation-Limited Circuit Complexity of Merging

Includes bibliographical references and index