Volume 48; Issue 5

Information Processing Letters

Volume 48; Issue 5
1

Efficient algorithms for finding the most vital edge of a minimum spanning tree

Kazuo Iwano, Naoki Katoh
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 196 KB
english, 1993
2

A simple correctness proof of the MCS contention-free lock

Theodore Johnson, Krishna Harathi
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 482 KB
english, 1993
3

Efficient edge domination problems in graphs

Dana L. Grinstead, Peter J. Slater, Naveed A. Sherwani, Nancy D. Holmes
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 558 KB
english, 1993
4

On the complexity of assembly partitioning

Lydia Kavraki, Jean-Claude Latombe, Randall H. Wilson
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 732 KB
english, 1993
5

A broadcasting algorithm in star graph interconnection networks

Jang-Ping Sheu, Wen-Hwa Liaw, Tzung-Shi Chen
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 464 KB
english, 1993
6

Fault diameter of star graphs

Yordan Rouskov, Pradip K. Srimani
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 766 KB
english, 1993
7

Queue-mergesort

Mordecai J. Golin, Robert Sedgewick
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 566 KB
english, 1993
8

Partitioning multiple-chain-like task across a host-satellite system

Alain Billionnet
Journal:
Information Processing Letters
Year:
1993
Language:
english
File:
PDF, 413 KB
english, 1993