Infect
发表于 2025-3-23 11:29:26
http://reply.papertrans.cn/39/3881/388025/388025_11.png
helper-T-cells
发表于 2025-3-23 14:34:45
http://reply.papertrans.cn/39/3881/388025/388025_12.png
无表情
发表于 2025-3-23 20:02:13
http://reply.papertrans.cn/39/3881/388025/388025_13.png
下边深陷
发表于 2025-3-23 23:37:06
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. 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
发表于 2025-3-24 06:16:42
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
发表于 2025-3-24 10:35:51
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
抛物线
发表于 2025-3-24 13:55:53
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
财政
发表于 2025-3-24 14:58:30
http://reply.papertrans.cn/39/3881/388025/388025_18.png
CLOWN
发表于 2025-3-24 22:06:15
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
发表于 2025-3-25 02:14:55
Literaturwissenschaft / Kulturwissenschaft graph is a leaf power if it is a .-leaf power for some .. Over 20 years ago, Nishimura et al. asked if recognition of leaf powers was in P. Recently, Lafond showed an XP algorithm when parameterized by ., while leaving the main question open. In this paper, we expl