Name: Algorithms and Computation
ISBN: 978-3-540-47501-9

Overview

Editors:

Toshihide Ibaraki,
Yasuyoshi Inagaki,
Kazuo Iwama,
Takao Nishizeki,
…
Masafumi Yamashita

Toshihide Ibaraki

View editor publications

You can also search for this editor in PubMed Google Scholar
Yasuyoshi Inagaki

View editor publications

You can also search for this editor in PubMed Google Scholar
Kazuo Iwama

View editor publications

You can also search for this editor in PubMed Google Scholar
Takao Nishizeki

View editor publications

You can also search for this editor in PubMed Google Scholar
Masafumi Yamashita

View editor publications

You can also search for this editor in PubMed Google Scholar

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

7617 Accesses
147 Citations
3 Altmetric

Buy print copy

Softcover Book USD 54.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Table of contents (51 papers)

Front Matter

Download chapter PDF
Methods in parallel algorithmics and who may need to know them?
- Uzi Vishkin
Pages 1-4
Download chapter PDF
Rectilinear paths among rectilinear obstacles
- D. T. Lee
Pages 5-20
Download chapter PDF
Linear time algorithms for k-cutwidth problem
- Maw-Hwa Chen, Sing-Ling Lee
Pages 21-30
Download chapter PDF
The k-edge-connectivity augmentation problem of weighted graphs
- Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka
Pages 31-40
Download chapter PDF
Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity
- Sachin Patkar, H. Narayanan
Pages 41-50
Download chapter PDF
The application of the searching over separators strategy to solve some NP-complete problems on planar graphs
- R. Z. Hwang, R. C. T. Lee
Pages 51-60
Download chapter PDF
Parallel and on-line graph coloring algorithms
- MagnÚs M. Halldórsson
Pages 61-70
Download chapter PDF
Competitive analysis of the Round Robin algorithm
- Tsuyoshi Matsumoto
Pages 71-77
Download chapter PDF
Competitive analysis of the on-line algorithms for multiple stacks systems
- Been-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang
Pages 78-87
Download chapter PDF
Self-adjusting augmented search trees
- Tony W. Lai
Pages 88-96
Download chapter PDF
Algorithms for a class of Min-Cut and Max-Cut problem
- Teofilo F. Gonzalez, Toshio Murayama
Pages 97-105
Download chapter PDF
Algorithms for rectilinear optimal multicast tree problem
- Jan-Ming Ho, M. T. Ko, Tze-Heng Ma, Ting-Yi Sung
Pages 106-115
Download chapter PDF
Approximating treewidth and pathwidth of some classes of perfect graphs
- Ton Kloks, Hans Bodlaender
Pages 116-125
Download chapter PDF
Graph spanners and connectivity
- Shuichi Ueno, Michihiro Yamazaki, Yoji Kajitani
Pages 126-134
Download chapter PDF
Randomized range-maxima in nearly-constant parallel time
- Omer Berkman, Yossi Matias, Uzi Vishkin
Pages 135-144
Download chapter PDF
Fault-tolerant broadcasting in binary jumping networks
- Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura
Pages 145-154
Download chapter PDF
Routing problems on the mesh of buses
- Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi
Pages 155-164
Download chapter PDF
Selection networks with 8n log₂ n size and O(log n) depth
- Shuji Jimbo, Akira Maruoka
Pages 165-174
Download chapter PDF
Relativizations of the P=? NP and other problems: Some developments in structural complexity theory
- Ronald V. Book
Pages 175-186
Download chapter PDF

Keywords

About this book

This volume gives the proceedings of ISAAC '92, the Third International Symposium on Algorithms and Computation, held in Nagoya, Japan, December 1992. The first symposium was held in Tokyo in 1990, as the first international symposium organized by SIGAL (Special Interest Groupon Algorithms in the Information Processing Society of Japan) to serve as anannual international forum in Asia for researchers in the area of algorithms. The second symposium was held in Taipei, Taiwan in 1991, where it was decided that computation would be included in the main scope of the symposium and that ISAAC would be its name. ISAAC '92 focuses on topics in design and analysis of algorithms, computational complexity, and theory of computation, including algorithms and data structures, parallel/distributed computing, automata and formal languages, probabilistic/approximation algorithms, computability and complexity, term rewriting systems, and computational geometry. The volume contains the accepted contributed papers and the invited papers.

Bibliographic Information

Book Title: Algorithms and Computation
Book Subtitle: Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings
Editors: Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-56279-6
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1992
Softcover ISBN: 978-3-540-56279-5Published: 26 November 1992
eBook ISBN: 978-3-540-47501-9Published: 14 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 516
Topics: Data Structures, Theory of Computation, Computational Mathematics and Numerical Analysis, Computation by Abstract Devices, Combinatorics, Probability Theory and Stochastic Processes

Publish with us

Policies and ethics

Algorithms and Computation

Overview

Buy print copy

Table of contents (51 papers)

Front Matter

Methods in parallel algorithmics and who may need to know them?

Rectilinear paths among rectilinear obstacles

Linear time algorithms for k-cutwidth problem

The k-edge-connectivity augmentation problem of weighted graphs

Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity

The application of the searching over separators strategy to solve some NP-complete problems on planar graphs

Parallel and on-line graph coloring algorithms

Competitive analysis of the Round Robin algorithm

Competitive analysis of the on-line algorithms for multiple stacks systems

Self-adjusting augmented search trees

Algorithms for a class of Min-Cut and Max-Cut problem

Algorithms for rectilinear optimal multicast tree problem

Approximating treewidth and pathwidth of some classes of perfect graphs

Graph spanners and connectivity

Randomized range-maxima in nearly-constant parallel time

Fault-tolerant broadcasting in binary jumping networks

Routing problems on the mesh of buses

Selection networks with 8n log₂ n size and O(log n) depth

Relativizations of the P=? NP and other problems: Some developments in structural complexity theory

Keywords

About this book

Bibliographic Information

Publish with us

Navigation

Algorithms and Computation

Overview

Buy print copy

Table of contents (51 papers)

Front Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation