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

Competitive searching in polygons—Beyond generalised streets

1995 ◽  
pp. 32-41 ◽  
Author(s):  
Amitava Datta ◽  
Christoph A. Hipke ◽  
Sven Schuierer

No quadrangulation is extremely odd

1995 ◽  
pp. 372-381 ◽  
Author(s):  
Prosenjit Bose ◽  
Godfried Toussaint

Learning of restricted RNLC graph languages

1995 ◽  
pp. 171-180 ◽  
Author(s):  
Sei'ichi Tani ◽  
Koichi Yamazaki
Keyword(s):  
Graph Languages

The parallel complexity of approximating the High Degree Subgraph problem

1995 ◽  
pp. 132-141 ◽  
Author(s):  
A. E. Andreev ◽  
A. Clementi ◽  
P. Crescenzi ◽  
E. Dahlhaus ◽  
S. de Agostino ◽  
...  
Keyword(s):  
Parallel Complexity ◽  
High Degree

Computing the Tutte polynomial of a graph of moderate size

1995 ◽  
pp. 224-233 ◽  
Author(s):  
Kyoko Sekine ◽  
Hiroshi Imai ◽  
Seiichiro Tani
Keyword(s):  
Tutte Polynomial ◽  
Moderate Size

A hard problem that is almost always easy

1995 ◽  
pp. 216-223 ◽  
Author(s):  
George Havas ◽  
B. S. Majewski
Keyword(s):  
Hard Problem

Finding dense subgraphs

1995 ◽  
pp. 102-111 ◽  
Author(s):  
Yuichi Asahiro ◽  
Kazuo Iwama
Keyword(s):  
Dense Subgraphs

A resource assignment problem on graphs

1995 ◽  
pp. 418-427 ◽  
Author(s):  
Satoshi Fujita ◽  
Tiko Kameda ◽  
Masafumi Yamashita
Keyword(s):  
Assignment Problem ◽  
Resource Assignment
Load More ...
Sign in / Sign up

Export Citation Format

Share Document