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

TOTAL DOCUMENTS

36

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540003311, 9783540363798

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP

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

10.1007/3-540-36379-3_23 ◽

2010 ◽

pp. 258-269 ◽

Author(s):

Edith Hemaspaandra ◽

Jörg Rothe ◽

Holger Spakowski

Keyword(s):

Parallel Access

Download Full-text

Connected and Loosely Connected List Homomorphisms

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

10.1007/3-540-36379-3_35 ◽

2002 ◽

pp. 399-412 ◽

Author(s):

Narayan Vikas

Download Full-text

Two Counterexamples in Graph Drawing

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

10.1007/3-540-36379-3_34 ◽

2002 ◽

pp. 391-398 ◽

Author(s):

O. Sýkora ◽

L.A. Székely ◽

I. Vrt'o

Keyword(s):

Download Full-text

Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies

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

10.1007/3-540-36379-3_20 ◽

2002 ◽

pp. 223-234 ◽

Author(s):

D. A. Fotakis ◽

S. E. Nikoletseas ◽

V. G. Papadopoulou ◽

P.G. Spirakis

Keyword(s):

Planar Graphs ◽

Download Full-text

Graph Separator Algorithms: A Refined Analysis

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

10.1007/3-540-36379-3_17 ◽

2002 ◽

pp. 186-197 ◽

Author(s):

Henning Fernau

Download Full-text

Safe Reduction Rules for Weighted Treewidth

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

10.1007/3-540-36379-3_16 ◽

2002 ◽

pp. 176-185 ◽

Author(s):

Frank van den Eijkhof ◽

Hans L. Bodlaender

Download Full-text

A Multi-scale Algorithm for the Linear Arrangement Problem

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

10.1007/3-540-36379-3_26 ◽

2002 ◽

pp. 296-309 ◽

Author(s):

Yehuda Koren ◽

David Harel

Keyword(s):

Linear Arrangement ◽

Multi Scale ◽

Arrangement Problem ◽

Linear Arrangement Problem

Download Full-text

Search in Indecomposable Graphs

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

10.1007/3-540-36379-3_8 ◽

2002 ◽

pp. 80-91 ◽

Author(s):

Alain Cournier

Download Full-text

Online Call Admission in Optical Networks with Larger Demands

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

10.1007/3-540-36379-3_29 ◽

2002 ◽

pp. 333-344 ◽

Author(s):

Sven Oliver Krumke ◽

Diana Poensgen

Keyword(s):

Optical Networks ◽

Download Full-text

On the Minimum Size of a Contraction-Universal Tree

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

10.1007/3-540-36379-3_3 ◽

2002 ◽

pp. 25-34

Author(s):

Olivier Bodini

Keyword(s):

Minimum Size ◽

Download Full-text