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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540922476, 9783540922483

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes

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

10.1007/978-3-540-92248-3_32 ◽

2008 ◽

pp. 360-371 ◽

Cited By ~ 1

Author(s):

Siamak Tazari ◽

Matthias Müller-Hannemann

Keyword(s):

Shortest Paths ◽

Closed Graph ◽

Graph Classes

Download Full-text

(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective

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

10.1007/978-3-540-92248-3_1 ◽

2008 ◽

pp. 1-13 ◽

Cited By ~ 3

Author(s):

Luca Cittadini ◽

Giuseppe Di Battista ◽

Massimo Rimondini

Keyword(s):

The Internet ◽

Stable Routing

Download Full-text

Digraph Decompositions and Monotonicity in Digraph Searching

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

10.1007/978-3-540-92248-3_30 ◽

2008 ◽

pp. 336-347 ◽

Cited By ~ 9

Author(s):

Stephan Kreutzer ◽

Sebastian Ordyniak

Download Full-text

Evaluations of Graph Polynomials

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

10.1007/978-3-540-92248-3_17 ◽

2008 ◽

pp. 183-194 ◽

Cited By ~ 7

Author(s):

Benny Godlin ◽

Tomer Kotek ◽

Johann A. Makowsky

Keyword(s):

Graph Polynomials

Download Full-text

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

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

10.1007/978-3-540-92248-3_27 ◽

2008 ◽

pp. 300-311 ◽

Cited By ~ 5

Author(s):

Xavier Muñoz ◽

Ignasi Sau

Keyword(s):

Traffic Grooming ◽

Bounded Degree ◽

Wdm Rings

Download Full-text

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

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

10.1007/978-3-540-92248-3_33 ◽

2008 ◽

pp. 372-383 ◽

Cited By ~ 3

Author(s):

Andreas Wiese ◽

Evangelos Kranakis

Keyword(s):

Unit Disk ◽

Unit Disk Graphs ◽

Location Aware ◽

Local Construction

Download Full-text

On Independent Sets and Bicliques in Graphs

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

10.1007/978-3-540-92248-3_16 ◽

2008 ◽

pp. 171-182 ◽

Cited By ~ 7

Author(s):

Serge Gaspers ◽

Dieter Kratsch ◽

Mathieu Liedloff

Keyword(s):

Independent Sets

Download Full-text

An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

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

10.1007/978-3-540-92248-3_19 ◽

2008 ◽

pp. 206-217 ◽

Cited By ~ 3

Author(s):

Gregory Gutin ◽

Adrian Johnstone ◽

Joseph Reddington ◽

Elizabeth Scott ◽

Anders Yeo

Keyword(s):

Convex Sets ◽

Input Output ◽

Acyclic Digraph

Download Full-text

Complexity of the Packing Coloring Problem for Trees

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

10.1007/978-3-540-92248-3_13 ◽

2008 ◽

pp. 134-145 ◽

Cited By ~ 1

Author(s):

Jiří Fiala ◽

Petr A. Golovach

Keyword(s):

Coloring Problem

Download Full-text

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

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

10.1007/978-3-540-92248-3_7 ◽

2008 ◽

pp. 66-77 ◽

Cited By ~ 3

Author(s):

Paul Bonsma ◽

Florian Zickfeld

Keyword(s):

Approximation Algorithm ◽

Spanning Trees ◽

Cubic Graphs

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes

(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective

Digraph Decompositions and Monotonicity in Digraph Searching

Evaluations of Graph Polynomials

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

On Independent Sets and Bicliques in Graphs

An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

Complexity of the Packing Coloring Problem for Trees

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

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