Titlebook: Combinatorial Algorithms; 24th International W Thierry Lecroq,Laurent Mouchard Conference proceedings 2013 Springer-Verlag Berlin Heidelber

Forsake

K. D. Bartle,I. L. Davies,M. W. RaynorWe consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot’s walk is chosen using only local information. In this paper, we present some current developments in the area. In particular, we focus on recent work on . and on the ..

狼群

Efficient Exploration of Anonymous Undirected GraphsWe consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot’s walk is chosen using only local information. In this paper, we present some current developments in the area. In particular, we focus on recent work on . and on the ..

JAUNT

Brands as Agents of Social Change,are breaking the trivial enumeration barrier by providing two faster algorithms: we first prove that the problem can be solved in . time needing ., and then describe an . algorithm using .. Our results rely on structural properties of a wrd-function, as well as on the best polynomial space algorithm for the . problem.

commute

essential-fats

https://doi.org/10.1007/978-3-642-74001-5ximum number of completely independent spanning trees in Sierpiński graphs are obtained as corollaries. In particular, our results for edge-disjoint Hamilton cycles and hub sets on iterated subdivided-line graphs are generalizations of the previously known results on Sierpiński graphs, while our proofs are simpler than those for Sierpiński graphs.

辮子帶來幫助

執(zhí)

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classesat these formalisms can describe problems which are W[1]-hard and even NP-hard on graphs of bounded tree-width. Additionally, our algorithms have only elementary dependence on the parameter and formula. We also show that both results are easily extended from vertex cover to neighborhood diversity.

ARC

Structural Properties of Subdivided-Line Graphsximum number of completely independent spanning trees in Sierpiński graphs are obtained as corollaries. In particular, our results for edge-disjoint Hamilton cycles and hub sets on iterated subdivided-line graphs are generalizations of the previously known results on Sierpiński graphs, while our proofs are simpler than those for Sierpiński graphs.

Phenothiazines

FLOAT