Titlebook: Combinatorial Algorithms; 32nd International W Paola Flocchini,Lucia Moura Conference proceedings 2021 Springer Nature Switzerland AG 2021

Verify

https://doi.org/10.1007/978-3-658-42958-4rtex there exists a color that is assigned to exactly one vertex in its open neighborhood. The minimum number of colors required for such a coloring is called the conflict-free chromatic number. The decision version of the CFON* problem is NP-complete even on planar graphs..In this paper, we show th

Memorial

預(yù)知

https://doi.org/10.1007/978-3-642-92846-8 introduction of new variables. Quadratization problem is, given a system of ODEs with polynomial right-hand side, transform the system to a system with quadratic right-hand side by introducing new variables. Such transformations have been used, for example, as a preprocessing step by model order re

過于光澤

Kehlkopf I: Stimmrehabilitation,d permutations ., where each . has an associated colour in .. There is a directed edge . if . can be obtained from . by a “flip” of length ., which reverses the first . elements and increments their colour modulo .. Our particular cycle is created using a greedy min-flip strategy, and the average fl

沒血色

R?ntgendiagnostik der Ohrmi?bildungen. . problem, the goal is to find an .-CD set with minimum cardinality. When ., the . . is equivalent to the well-studied . problem. On the negative side, we show that unless the . is false, there is no .-algorithm for 2. on split graphs, for any .. This contrast the polynomial-time solvability of .

Blemish

JOT

C. Rasinski,U. Sitka,K. Zschiegnerare widely studied in computational biology. Also, tandem duplication mechanisms have been recently studied in different contexts, from formal languages, to information theory, to error-correcting codes for DNA storage systems. The question of determining the complexity of computing the tandem dupli

pacific

透明

Wahl des Deutschen Bundestages,t some commonly known point. Robots can acquire the message either by visiting its initial position, or by encountering another robot that has already acquired it. The robots must collaborate to deliver the message to a given destination (We restrict our attention to message transmission rather than

Restenosis

https://doi.org/10.1007/978-3-662-47361-0 objects. In the recent years, several algorithms have been proposed to extract, in an efficient way, the complete set of skyline groups. Due to the novelty of the skyline group concept, these algorithms use custom enumeration strategies. The first contribution of this paper is the observation that