Algorithms and Computation: 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings: 1178 - Brossura

Miyano, Satoru; Igarashi, Yoshihide; Suri, Subhash; Asano, Tetsuo; Nagamochi, Hiroshi

Brossura

ISBN 10: 3540620486 ISBN 13: 9783540620488

Casa editrice: Springer, 2008

Riassunto

This book constitutes the refereed proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96, held in Osaka, Japan, in December 1996.
The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searching and sorting, networking, scheduling, and coding and cryptology.

Su questo libro

Contenuti

Applications of a numbering scheme for polygonal obstacles in the plane.- Multicast communication in high speed networks.- Incremental convex hull algorithms are not output sensitive.- Separating and shattering long line segments.- Optimal line bipartitions of point sets.- Interval finding and its application to data mining.- On the approximability of the Steiner tree problem in phylogeny.- Approximation and special cases of common subtrees and editing distance.- Two-dimensional dynamic dictionary matching.- Discovering unbounded unions of regular pattern languages from positive examples.- Extremal problems for geometric hypergraphs.- Computing fair and bottleneck matchings in geometric graphs.- Computing the maximum overlap of two convex polygons under translations.- OBDDs of a monotone function and of its prime implicants.- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs.- Graph searching on chordal graphs.- An algorithm for enumerating all directed spanning trees in a directed graph.- Vertex ranking of asteroidal triple-free graphs.- Recursively divisible problems.- StUSPACE(log n) ?-DSPACE(log2 n/log log n).- Finding edge-disjoint paths in partial k-trees.- Optimal augmentation for bipartite componentwise biconnectivity in linear time.- Towards more precise parallel biconnectivity approximation.- The complexity of probabilistic versus deterministic finite automata.- Bounded length UCFG equivalence.- The Steiner Minimal Tree problem in the ?-geometry plane.- A study of the LMT-skeleton.- A new subgraph of minimum weight triangulations.- Dynamic tree routing under the “matching with consumption” model.- Dimension-exchange token distribution on the mesh and the torus.- Directed hamiltonian packing in d-dimensional meshes and its application.- k-pairs non-crossing shortest paths in a simple polygon.- Minimum convex partition of a polygon with holes by cuts in given directions.- Efficient list ranking on the reconfigurable mesh, with applications.- Periodic merging networks.- Minimizing wavelengths in an all-optical ring network.- Competitive analysis of on-line disk scheduling.- Scheduling interval ordered tasks with non-uniform deadlines.- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis.- The multi-variable modular polynomial and its applications to cryptography.- Bounds and algorithms for a practical task allocation model (extended abstract).- Scheduling algorithms for strict multithreaded computations.- On multi-threaded Paging.- A fast and efficient homophonic coding algorithm.- An improvement of the digital cash protocol of Okamoto and Ohta.

Dettagli dell?edizione

• Editore: Springer
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540620486
• ISBN 13: 9783540620488
• Rilegatura: Copertina flessibile
• Numero di pagine: 468
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania