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

conflate

https://doi.org/10.1007/978-3-662-26431-7 sparse instances, we give an algorithm that counts the number of dominating sets of each size . in a graph in . time and polynomial space. We also give an algorithm for the domatic number problem running in . time and polynomial space.

Blasphemy

https://doi.org/10.1007/978-3-663-02158-2 .. We investigate the relationship between popularity and stability, and describe efficient algorithms to test a matching for popularity in these settings. We also show that, when ties are permitted in the preferences, it is NP-hard to determine whether a popular matching exists in both the Roommates and Marriage cases.

assail

https://doi.org/10.1007/978-3-8350-9563-2phs this equality is true also for any even Δ ≥ 6. In this paper we show that it is true for any Δ ≥ 10, leaving open only the cases Δ= 6, 8..We present also an .(.log.) algorithm for partitioning a planar graph into max {la(.), 5} linear forests, which is optimal when Δ ≥ 9.

Colonnade

Biofeedback

Mechanisms for the Marriage and the Assignment Game in many areas. Most notably, it has lead to a number of truthful mechanisms that have seen a recent rejuvenation in the context of sponsored search. In this paper we survey the history of these problems and provide several links to ongoing research in the field.

中国纪念碑

手工艺品

Hamper