Sciweavers

9 search results - page 1 / 2

» wg 2001

10

WG
2001
Springer

93views Theoretical Computer Science» more WG 2001»

Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

13 years 9 months ago

Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

Download www.cs.kent.edu

Feodor F. Dragan

claim paper

Read More »

8

WG
2001
Springer

82views Theoretical Computer Science» more WG 2001»

The Complexity of the Matching-Cut Problem

13 years 9 months ago

The Complexity of the Matching-Cut Problem

Download web.dia.uniroma3.it

Maurizio Patrignani, Maurizio Pizzonia

claim paper

Read More »

9

WG
2001
Springer

69views Theoretical Computer Science» more WG 2001»

Planarity of the 2-Level Cactus Model

13 years 9 months ago

Planarity of the 2-Level Cactus Model

Download www.ub.uni-konstanz.de

Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner

claim paper

Read More »

9

WG
2001
Springer

93views Theoretical Computer Science» more WG 2001»

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

13 years 9 months ago

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

Download www.alice-dsl.net

Clemens Gröpl, Stefan Hougardy, Till Nierhoff...

claim paper

Read More »

10

WG
2001
Springer

79views Theoretical Computer Science» more WG 2001»

Critical and Anticritical Edges in Perfect Graphs

13 years 9 months ago

Critical and Anticritical Edges in Perfect Graphs

Download www.math.uni-magdeburg.de

We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...

Annegret Wagler

claim paper

Read More »

« Prev « First page 1 / 2 Last » Next »