Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540583257, 9783540486534

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Simple and efficient graph compression schemes for dense and complement graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_211 ◽

1994 ◽

pp. 451-459 ◽

Cited By ~ 1

Author(s):

Ming-Yang Kao ◽

Shang-Hua Teng

Keyword(s):

Graph Compression

Download Full-text

A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_225 ◽

1994 ◽

pp. 575-583 ◽

Cited By ~ 6

Author(s):

Seiichiro Tani ◽

Hiroshi Imai

Keyword(s):

Binary Decision Diagram ◽

Ordered Binary Decision Diagram ◽

Binary Decision

Download Full-text

Achieving the shortest clock period by inserting the minimum amount of delay

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_236 ◽

1994 ◽

pp. 669-677

Author(s):

Shangzhi Sun ◽

David H. C. Du ◽

Guoliang Xue

Keyword(s):

Minimum Amount ◽

Clock Period

Download Full-text

The totally-perfect bipartite graph and its construction

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_221 ◽

1994 ◽

pp. 541-549

Author(s):

Kunihiro Fujiyoshi ◽

Yoji Kajitani ◽

Hiroshi Niitsu

Keyword(s):

Bipartite Graph

Download Full-text

Extended graph connectivity and its gradually increasing parallel complexity

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_214 ◽

1994 ◽

pp. 478-486

Author(s):

Chuzo Iwamoto ◽

Kazuo Iwama

Keyword(s):

Graph Connectivity ◽

Parallel Complexity ◽

Extended Graph

Download Full-text

Analysing deletions in competitive self-adjusting linear list algorithms

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_209 ◽

1994 ◽

pp. 433-441 ◽

Cited By ~ 1

Author(s):

Lucas Chi Kwong Hui ◽

Charles U. Martel

Keyword(s):

Linear List

Download Full-text

An approximation scheme for some Steiner tree problems in the plane

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_206 ◽

1994 ◽

pp. 414-422 ◽

Cited By ~ 3

Author(s):

Tao Jiang ◽

Lusheng Wang

Keyword(s):

Steiner Tree ◽

Approximation Scheme ◽

Steiner Tree Problems

Download Full-text

Optimal routing of permutations on rings

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_200 ◽

1994 ◽

pp. 360-368 ◽

Cited By ~ 1

Author(s):

Xiaojun Shen ◽

Qing Hu ◽

Hao Dai ◽

Xiangzu Wang

Keyword(s):

Optimal Routing

Download Full-text

Fast deterministic Hot-Potato routing on processor arrays

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_197 ◽

1994 ◽

pp. 333-341 ◽

Cited By ~ 8

Author(s):

Michael Kaufmann ◽

Harald Lauer ◽

Heiko Schröder

Keyword(s):

Processor Arrays

Download Full-text

Unifying themes for network selection

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-58325-4_170 ◽

1994 ◽

pp. 92-100 ◽

Cited By ~ 5

Author(s):

Sanguthevar Rajasekaran ◽

Wang Chen ◽

Shibu Yooseph

Keyword(s):

Network Selection

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Simple and efficient graph compression schemes for dense and complement graphs

A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs

Achieving the shortest clock period by inserting the minimum amount of delay

The totally-perfect bipartite graph and its construction

Extended graph connectivity and its gradually increasing parallel complexity

Analysing deletions in competitive self-adjusting linear list algorithms

An approximation scheme for some Steiner tree problems in the plane

Optimal routing of permutations on rings

Fast deterministic Hot-Potato routing on processor arrays

Unifying themes for network selection

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications