Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

29

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540637578, 9783540696438

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the number of simple cycles in planar graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024484 ◽

1997 ◽

pp. 15-24 ◽

Author(s):

Helmut Alt ◽

Ulrich Fuchs ◽

Klaus Kriegel

Keyword(s):

Download Full-text

Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024504 ◽

1997 ◽

pp. 273-287 ◽

Author(s):

Erich Prisner

Download Full-text

Asteroidal sets in graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024501 ◽

1997 ◽

pp. 229-241 ◽

Author(s):

Ton Kloks ◽

Dieter Kratsch ◽

Haiko Müller

Download Full-text

Acyclic orientations for deadlock prevention in interconnection networks

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024487 ◽

1997 ◽

pp. 52-64 ◽

Author(s):

Jean-Claude Bermond ◽

Miriam Di Ianni ◽

Michele Flammini ◽

Stephane Perennes

Keyword(s):

Interconnection Networks ◽

Deadlock Prevention ◽

Acyclic Orientations

Download Full-text

Parallel algorithms for treewidth two

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024496 ◽

1997 ◽

pp. 157-170 ◽

Author(s):

Babette de Fluiter ◽

Hans L. Bodlaender

Keyword(s):

Parallel Algorithms

Download Full-text

Algorithms for the treewidth and minimum fill-in of HHD-free graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024492 ◽

1997 ◽

pp. 109-117 ◽

Author(s):

H. J. Broersma ◽

E. Dahlhaus ◽

T. Kloks

Download Full-text

The bounded tree-width problem of context-free graph languages

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024506 ◽

1997 ◽

pp. 303-317

Author(s):

R. Skodinis

Keyword(s):

Context Free ◽

Graph Languages

Download Full-text

On optimal graphs embedded into paths and rings, with analysis using l 1-spheres

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024497 ◽

1997 ◽

pp. 171-183 ◽

Author(s):

Yefim Dinitz ◽

Marcelo Feighelstein ◽

Shmuel Zaks

Download Full-text

NP-completeness results for minimum planar spanners

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024490 ◽

1997 ◽

pp. 85-99 ◽

Author(s):

Ulrik Brandes ◽

Dagmar Handke

Keyword(s):

Np Completeness

Download Full-text

Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/bfb0024482 ◽

1997 ◽

pp. 1-1

Author(s):

David P. Williamson

Keyword(s):

Linear Programming ◽

Satisfiability Problems

Download Full-text