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

TOTAL DOCUMENTS

26

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540538325, 9783540463108

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Comparing the expressibility of two languages formed using NP-complete graph operators

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

10.1007/3-540-53832-1_49 ◽

1991 ◽

pp. 276-290 ◽

Author(s):

Iain A. Stewart

Keyword(s):

Complete Graph ◽

Download Full-text

Remarks on some concurrency measures

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

10.1007/3-540-53832-1_45 ◽

1991 ◽

pp. 221-238 ◽

Author(s):

M. Habib ◽

M. Morvan ◽

J. X. Rampon

Download Full-text

Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems

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

10.1007/3-540-53832-1_39 ◽

1991 ◽

pp. 140-153 ◽

Author(s):

Fillia Makedon ◽

Spyros Tragoudas

Keyword(s):

Optimal Solutions ◽

Circuit Partitioning ◽

Partitioning Problems

Download Full-text

Optimal parallel algorithms for sparse graphs

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

10.1007/3-540-53832-1_27 ◽

1991 ◽

pp. 1-17 ◽

Author(s):

Grammati E. Pantziou ◽

Paul G. Spirakis ◽

Christos D. Zaroliagis

Keyword(s):

Parallel Algorithms ◽

Download Full-text

On the transition graphs of automata and grammars

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

10.1007/3-540-53832-1_51 ◽

1991 ◽

pp. 311-337 ◽

Author(s):

Didier Caucal ◽

Roland Monfort

Keyword(s):

Transition Graphs

Download Full-text

The VLSI layout problem in various embedding models

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

10.1007/3-540-53832-1_38 ◽

1991 ◽

pp. 130-139 ◽

Author(s):

Michael Formann ◽

Frank Wagner

Keyword(s):

Layout Problem ◽

Download Full-text

On feedback problems in planar digraphs

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

10.1007/3-540-53832-1_33 ◽

1991 ◽

pp. 79-89 ◽

Author(s):

Hermann Stamm

Download Full-text

Algebraic approach to graph transformation based on single pushout derivations

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

10.1007/3-540-53832-1_52 ◽

1991 ◽

pp. 338-353 ◽

Author(s):

M. Löwe ◽

H. Ehrig

Keyword(s):

Graph Transformation ◽

Algebraic Approach

Download Full-text

Decomposition of linear recursive logic programs

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

10.1007/3-540-53832-1_50 ◽

1991 ◽

pp. 291-310

Author(s):

Dietmar Seipel

Keyword(s):

Download Full-text

Separation problems and circular arc systems

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

10.1007/3-540-53832-1_47 ◽

1991 ◽

pp. 251-259 ◽

Author(s):

Paul Fischer ◽

Hans Ulrich Simon

Keyword(s):

Circular Arc ◽

Separation Problems

Download Full-text