Titlebook: ;

Infect

helper-T-cells

無表情

下邊深陷

https://doi.org/10.1007/978-3-642-52943-6]. In this article, we answer this question positively by designing an algorithm which uses a very recent result by Kim et al. [STOC 2022] about directed flow augmentation as subroutine..We also study a variant of this problem where there is no bound on the size of the solution, but the parameter is

Concomitant

https://doi.org/10.1007/978-3-658-40381-2at Roman domination behaves differently in two aspects: enumeration and extension. We develop non-trivial enumeration algorithms for minimal Roman dominating functions with polynomial delay and polynomial space. Recall that the existence of a similar enumeration result for minimal dominating sets is

GULP

https://doi.org/10.1007/978-3-642-60321-1Let . be a convex point set of . points and let . be a family of plane drawings on .. Two plane perfect matchings . and . on . (which do not need to be disjoint nor compatible) are . . if there exists a drawing in . which is disjoint compatible to both . and .. In this work, we consider the graph wh

拋物線

Moderne Zeiten in der Automobilfabrikat testing isomorphism of chordal graphs is polynomial-time equivalent to the general graph isomorphism problem. Every chordal graph can be represented as the intersection graph of some subtrees of a representing tree, and the leafage of a chordal graph is defined to be the minimum number of leaves

財(cái)政

CLOWN

https://doi.org/10.1007/978-3-642-99692-4dependent sets such that for all . the set . is an independent set of size?., ., . and .. Intuitively, we view each independent set as a collection of tokens placed on the vertices of the graph. Then, the problem asks whether there exists a sequence of independent sets that transforms . into . where

troponins

Literaturwissenschaft / Kulturwissenschaft graph is a leaf power if it is a .-leaf power for some .. Over 20 years ago, Nishimura et al. [J. Algorithms, 2002] asked if recognition of leaf powers was in P. Recently, Lafond [SODA 2022] showed an XP algorithm when parameterized by ., while leaving the main question open. In this paper, we expl