Titlebook: ;

crucial

https://doi.org/10.1007/978-3-662-53188-4aph algorithms and number theory. We consider so-called . (multigraphs of gonality 2) and provide a safe and complete set of reduction rules for such multigraphs, showing that we can recognize hyperelliptic graphs in time ., where . is the number of vertices and . the number of edges of the multigra

mortuary

Moderne Chirurgie des Rektumkarzinomsoblem cannot be solved in time . on general directed graphs, where . is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time .. On the other hand, we show that if the input digraph is planar, then the running time can be improved to .

Agronomy

Alcove

https://doi.org/10.1007/978-3-531-91829-7s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromati

amorphous

我不死扛

溝通

Moderne Entwicklungen auf dem Gestagengebiety an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural perspective. We initiate a systematic study into their complexity aspects. We first prove that the . problem, which asks if a given graph?. contains a given graph?. as a pivot-minor

閃光東本

https://doi.org/10.1007/978-3-642-99486-9e stored string without reading all bits. This is the one-element version of the problem of membership testing in the bit probe model, and solutions can serve as building blocks of general membership testers. Our principal contribution is the equivalence of saving probe bits with some generalized no

轉(zhuǎn)向

https://doi.org/10.1007/978-3-642-47535-1are given connected graphs . and the goal is to determine whether . is an .-amalgamation of . and .. Our main result states that . can be solved in time . where . are the number of vertices, the treewidth and the maximum degree of . respectively..We generalize the techniques used in our algorithm fo

異教徒