ADJ
发表于 2025-4-1 04:53:44
http://reply.papertrans.cn/39/3881/388043/388043_61.png
Permanent
发表于 2025-4-1 07:16:32
http://reply.papertrans.cn/39/3881/388043/388043_62.png
轻打
发表于 2025-4-1 10:16:34
http://reply.papertrans.cn/39/3881/388043/388043_63.png
calamity
发表于 2025-4-1 14:37:49
Molecular Mechanisms of Fanconi Anemiafinite classes of graph covering problems we derive .-completeness results by reductions from graph coloring problems. We illustrate this methodology by classifying all graph covering problems defined by simple graphs with at most 6 vertices.
locus-ceruleus
发表于 2025-4-1 20:36:13
https://doi.org/10.1007/978-1-4419-0298-6 eNCE graph grammars, nonterminal nodes are never adjacent. In this paper, we show that given a confluent or boundary eNCE graph grammar ., the problem whether the language . defined by . is empty, is DEXPTIME-complete.
Lethargic
发表于 2025-4-2 01:23:37
https://doi.org/10.1007/978-94-011-1506-3solved in . if the maximum value of . is poly-logarithmic in the input size [., LNCS . (1991) 385–395]. In this paper, we show a nontrivial interesting result that the Max-.-DS problem for planar graphs can be solved in .(log..) time with . processors on a CRCW PRAM, where . is the input size.
Ccu106
发表于 2025-4-2 05:06:21
Domino treewidth,lgorithms that — for fixed . — decide whether a given graph . has domino treewidth at most .. If . is not fixed, this problem is NP-complete. The domino treewidth problem is hard for the complexity classes .[.] for all . ξ ., and hence the problem for fixed . is unlikely to be solvable in .(..), where . is a constant, not depending on ..
Fissure
发表于 2025-4-2 08:46:13
http://reply.papertrans.cn/39/3881/388043/388043_68.png