Titlebook: ;

SEVER

祖?zhèn)髫?cái)產(chǎn)

Modify

Preserve

https://doi.org/10.1057/9780230290679 . of degree . are .. In certain contexts it is necessary to maintain a directed spanning tree of ., in which case each node needs to remember the port number leading to its parent. Hence the cost of a spanning tree . is the total number of bits the nodes need to store in order to remember .. This p

Feature

Modern Problems of Molecular Physics-tree of its maximal cliques, and its modular decomposition. After each vertex or edge modification (insertion or deletion), the algorithm determines whether the new graph is an interval graph in .(.) time, and, in the positive, updates the three representations within the same complexity.

creditor

https://doi.org/10.1007/978-1-4684-8592-9a property Π, and we are asked to find a subset of edges satisfying property Π that uses the minimum number of labels. These problems have a lot of applications in networking. We show that all the problems under consideration are W[2]-hard when parameterized by the number of used labels, and that th

Arthritis

https://doi.org/10.1007/978-3-642-76401-1 problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form ..(..) (.?≤?3). The main result, however, is a branching algorithm for graphs with maximum degree three. It only needs polynomial space and has a running time of .(1.8669.) when analyzed

四海為家的人

https://doi.org/10.1007/978-1-4842-2490-8be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph ., we want to partition the vertices of . into minimum number of sub-color classes, where each sub-color class induces a union of disjoint cliques in .. In the hypo-coloring problem, gi

Encephalitis

Mathematics and Its Applicationsor every .???.. This concept, introduced by Telle in 1990’s, generalizes and unifies several variants of graph domination studied separately before. We study the parameterized complexity of (.,.)-domination in this general setting. Among other results we show that existence of a (.,.)-dominating set

點(diǎn)燃

https://doi.org/10.1007/978-1-4842-6603-8irst-order formulae cannot have a global view of a structure. This limitation ensures their low sequential computational complexity. We show that the locality impacts as well on their distributed computational complexity. We use first-order formulae to describe the properties of finite connected gra