Volume 51; Issue 3

Information Processing Letters

Volume 51; Issue 3

1

A linear algorithm for centering a spanning tree of a biconnected graph

K.S. Easwarakumar, C.Pandu Rangan, G.A. Cheston

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 381 KB

english, 1994

2

Enumerating the kernels of a directed graph with no odd circuits

Jayme L. Szwarcfiter, Guy Chaty

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 473 KB

english, 1994

3

A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m

Erl-Huei Lu, Yi-Chang Chen, Hsiao-Peng Wuu

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 313 KB

english, 1994

4

Internal path length of the binary representation of heap-ordered trees

Wen-Chin Chen, Wen-Chun Ni

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 245 KB

english, 1994

5

Counting trees in a graph is #P-complete

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 469 KB

english, 1994

6

Approximations for the maximum acyclic subgraph problem

Refael Hassin, Shlomi Rubinstein

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 722 KB

english, 1994

7

The convex-hull-and-line traveling salesman problem: a solvable case

Vladimir G. Deineko, René van Dal, Günter Rote

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 649 KB

english, 1994

8

On competitive on-line algorithms for the dynamic priority-ordering problem

G. Ramalingam, Thomas Reps

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 625 KB

english, 1994

9

Enumeration of binary trees

Vinnakota Bapiraju, V.V.Bapeswara Rao

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 185 KB

english, 1994