Algorithms and Computations - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

48

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540605737, 9783540477662

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The parallel complexity of approximating the High Degree Subgraph problem

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015416 ◽

1995 ◽

pp. 132-141 ◽

Author(s):

A. E. Andreev ◽

A. Clementi ◽

P. Crescenzi ◽

E. Dahlhaus ◽

S. de Agostino ◽

...

Keyword(s):

Parallel Complexity ◽

Download Full-text

Computing the Tutte polynomial of a graph of moderate size

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015427 ◽

1995 ◽

pp. 224-233 ◽

Author(s):

Kyoko Sekine ◽

Hiroshi Imai ◽

Seiichiro Tani

Keyword(s):

Tutte Polynomial ◽

Download Full-text

A hard problem that is almost always easy

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015426 ◽

1995 ◽

pp. 216-223 ◽

Author(s):

George Havas ◽

B. S. Majewski

Keyword(s):

Download Full-text

Finding dense subgraphs

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015413 ◽

1995 ◽

pp. 102-111 ◽

Author(s):

Yuichi Asahiro ◽

Kazuo Iwama

Keyword(s):

Dense Subgraphs

Download Full-text

Competitive searching in polygons—Beyond generalised streets

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015406 ◽

1995 ◽

pp. 32-41 ◽

Author(s):

Amitava Datta ◽

Christoph A. Hipke ◽

Sven Schuierer

Download Full-text

A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015438 ◽

1995 ◽

pp. 322-331 ◽

Author(s):

Siu-Wing Cheng ◽

Chi-Keung Tang

Keyword(s):

Fast Algorithm ◽

Extremal Point ◽

Steiner Trees ◽

Download Full-text

The first subquadratic algorithm for complete linkage clustering

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015445 ◽

1995 ◽

pp. 392-401 ◽

Author(s):

Drago Krznaric ◽

Christos Levcopoulos

Keyword(s):

Complete Linkage

Download Full-text

No quadrangulation is extremely odd

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015443 ◽

1995 ◽

pp. 372-381 ◽

Author(s):

Prosenjit Bose ◽

Godfried Toussaint

Download Full-text

Learning of restricted RNLC graph languages

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015421 ◽

1995 ◽

pp. 171-180 ◽

Author(s):

Sei'ichi Tani ◽

Koichi Yamazaki

Keyword(s):

Graph Languages

Download Full-text

Finding smallest supertrees

Algorithms and Computations - Lecture Notes in Computer Science ◽

10.1007/bfb0015414 ◽

1995 ◽

pp. 112-121

Author(s):

Arvind Gupta ◽

Naomi Nishimura

Download Full-text