Titlebook: Algorithms and Complexity; 7th International Co Tiziana Calamoneri,Josep Diaz Conference proceedings 2010 Springer-Vralg Berlin Heidelberg

喷油井

GLADE

发怨言

小画像

bacteria

acclimate

A Parameterized Algorithm for , give an algorithm with running time . to solve this problem, where . is the size of a minimum vertex cover of the graph (., .). Hence we show that the problem is fixed parameter tractable when parameterized by .. Note that the parameter does not assume any restriction on the input graph, and it concerns only the additional edge set ..

DOTE

Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown.) we designed an algorithm for testing computability by an OBDD with a . order, which is known to the algorithm. Thus, we extend our knowledge concerning testing of functions that are characterized by their computability using simple computation devices and in the process gain some insight concerning these devices.

Lime石灰

Strategic Coloring of a Graph the coloring game, we give worst case bounds on the social cost of stable states. Our main contribution is an improved (tight) bound for the worst case social cost of a Nash equilibrium, and the study of strong equilibria, their existence and how far they are from social optima.

EXALT

Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weightsices. The analysis of the kernel size is based on a new extremal result which shows that every graph . that excludes some simple substructures always contains a spanning tree with at least |.|/5.5 leaves.

optic-nerve

Der Kampf um die rechte Ordnunger we present a first non-trivial exact algorithm whose running time is in .. We use our algorithm to solve the . problem in .. This improves the current best known algorithm, which used sophisticated run-time analysis via the measure and conquer technique to solve the problem in ..