Skip to main content
  • Conference proceedings
  • © 1996

Algorithms and Computation

7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1178)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 1996.

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (45 papers)

  1. StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)

    • Eric Allender, Klaus-Jörn Lange
    Pages 193-202
  2. Finding edge-disjoint paths in partial k-trees

    • Xiao Zhou, Syurei Tamura, Takao Nishizeki
    Pages 203-212
  3. Towards more precise parallel biconnectivity approximation

    • Ka Wong Chong, Tak Wah Lam
    Pages 223-232
  4. Bounded length UCFG equivalence

    • B. Litow
    Pages 239-246
  5. A study of the LMT-skeleton

    • Siu-Wing Cheng, Naoki Katoh, Manabu Sugai
    Pages 256-265
  6. A new subgraph of minimum weight triangulations

    • Cao An Wang, Francis Chin, Yin-Feng Xu
    Pages 266-274
  7. Dynamic tree routing under the “matching with consumption” model

    • Grammati E. Pantziou, Alan Roberts, Antonis Symvonis
    Pages 275-284
  8. Dimension-exchange token distribution on the mesh and the torus

    • Michael E. Houle, Gavin Turner
    Pages 285-294
  9. Directed hamiltonian packing in d-dimensional meshes and its application

    • Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
    Pages 295-304
  10. k-pairs non-crossing shortest paths in a simple polygon

    • Evanthia Papadopoulou
    Pages 305-314
  11. Efficient list ranking on the reconfigurable mesh, with applications

    • Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Pages 326-335
  12. Periodic merging networks

    • Mirosław Kutyłowski, Krzysztof Loryś, Brigitte Oesterdiekhoff
    Pages 336-345
  13. Competitive analysis of on-line disk scheduling

    • Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Pages 356-365

Other Volumes

  1. Algorithms and Computation

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access