Titlebook: Wachstum ohne Grenzen; Globaler Wohlstand d Erich Becker-Boost,Ernst Fiala BookLatest edition Springer-Verlag Wien 2001 Bev?lkerungswachstu

排出

evince

CODA

Erich Becker-Boost,Ernst Fialaorithms using linear programming or complex parametric search and scaling techniques. This improvement is a big step for such a well-investigated problem..To the contrary, the single-pair generalized shortest path problem SPGSP is NP-hard, even with nonnegative costs and uniformly lossy arcs.

大猩猩

用肘

Erich Becker-Boost,Ernst Fialatime on a class of graphs of clique-width at most . in which for every graph . an expression defining it can be constructed in .(.(|.|,|.|)) time. By the above this applies in particular to (.,. – 4) graphs, ..-tidy graphs and ..-sparse graphs with . linear..Finally, we show that the above results c

arsenal

Erich Becker-Boost,Ernst Fialaimum .-matching for the case when no set .(.) contains a gap of length greater than 1. This also yields the first pseudopolynomial algorithm for the weighted version of the problem, in which each edge of the graph is assigned a weight and the goal is to compute a minimum or maximum weight .-matching

我沒有強(qiáng)迫

Erich Becker-Boost,Ernst Fiala forbidden transitions in planar graphs. We prove that the problem is NP-complete in planar graphs and particularly in grids. In addition, we show that the problem can be solved in polynomial time in graphs with bounded treewidth. More precisely, we show that there is an algorithm which solves the p

異端邪說下

Erich Becker-Boost,Ernst Fialaample, the variant with no restrictions on moves is represented by the Complete .. graph; the variant in which the pegs constitute a cycle and moves are allowed only in one direction — by the uni-directional graph ....For all 3-peg variants, the number of moves grows exponentially fast with .. Howev

oblique

Erich Becker-Boost,Ernst Fiala forbidden isometric subgraphs for which any LexBFS-ordering of the graph is a common perfect elimination ordering of all its nontrivial powers. As an application we get a linear time approximation of the diameter for weak bipolarizable graphs, a subclass of HHD-free graphs containing all chordal gr

landfill

Erich Becker-Boost,Ernst Fialahis represents the largest known subclass of subcubic graphs such that an optimal acyclic vertex coloring can be found in polynomial-time. We show that this bound is tight by proving that the problem is NP-hard for cubic line graphs (and therefore, claw-free graphs) of maximum degree .?≥?4. An inter