Titlebook: ;

AGOG

Parameterized Complexity for Domination Problems on Degenerate Graphsfferent classes of graphs. We explore the boundary between fixed-parameter tractable and W-hard problems on sparse graphs. More precisely, we expand the list of domination problems which are fixed-parameter tractable(FPT) for degenerate graphs by proving that ... and .. are FPT. From the other side

捏造

An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph generating all input-output constrained convex (IOCC) sets in an acyclic digraph, which uses several novel ideas. We show that our algorithm is more efficient than algorithms described in the literature in both the worst case and computational experiments. IOCC sets of acyclic digraphs are of inter

Mumble

https://doi.org/10.1057/9781137035516We show that there exist series-parallel graphs requiring .(. log.) area in any straight-line or poly-line grid drawing. Such a result is achieved by proving that, in any straight-line or poly-line drawing of .., one side of the bounding box has length .(.).

osteoclasts

A Lower Bound on the Area Requirements of Series-Parallel GraphsWe show that there exist series-parallel graphs requiring .(. log.) area in any straight-line or poly-line grid drawing. Such a result is achieved by proving that, in any straight-line or poly-line drawing of .., one side of the bounding box has length .(.).

合同

Mindfulness

Faster Exact Bandwidthn. In 2000, Feige an Kilian [4] came up with a ..(10.)-time algorithm. Since then there has been a growing interest in exponential time algorithms but this bound has not been improved..In this paper we present a new and quite simple ..(5.) algorithm. We also obtain even better bound in some special cases.

吼叫

Graph-Theoretic Concepts in Computer Science978-3-540-92248-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

Generator

https://doi.org/10.1057/9781137021885..We accompany this .-hardness result by a polynomial time algorithm for trees for closely related variant of the packing coloring problem where the lower bounds on the distances between vertices inside color classes are determined by an infinite nondecreasing sequence of bounded integers.

極小

https://doi.org/10.1007/978-1-349-24551-2efficient than algorithms described in the literature in both the worst case and computational experiments. IOCC sets of acyclic digraphs are of interest in the area of modern embedded processor technology.

configuration

https://doi.org/10.1057/9781137326607and algorithms have been proposed in the literature to study routing oscillations. The goal of this paper is to provide a survey of state of the art contributions in this field with an emphasis on the algorithmic aspects.