偶像 发表于 2025-3-30 11:50:31

http://reply.papertrans.cn/16/1532/153104/153104_51.png

滔滔不绝的人 发表于 2025-3-30 12:48:37

http://reply.papertrans.cn/16/1532/153104/153104_52.png

你敢命令 发表于 2025-3-30 20:08:52

http://reply.papertrans.cn/16/1532/153104/153104_53.png

带子 发表于 2025-3-30 21:41:20

http://reply.papertrans.cn/16/1532/153104/153104_54.png

expire 发表于 2025-3-31 02:54:31

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints,oblems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts fo

思考 发表于 2025-3-31 08:49:14

http://reply.papertrans.cn/16/1532/153104/153104_56.png

anaerobic 发表于 2025-3-31 13:06:57

http://reply.papertrans.cn/16/1532/153104/153104_57.png

CHYME 发表于 2025-3-31 13:41:36

http://reply.papertrans.cn/16/1532/153104/153104_58.png

expdient 发表于 2025-3-31 18:52:07

http://reply.papertrans.cn/16/1532/153104/153104_59.png

爱哭 发表于 2025-3-31 22:10:14

The Fregean Notion of an Object,y of graphs . as subgraphs, minors and topological minors, respectively, and completely determine which of these classes have bounded clique-width. Finally, we show algorithmic consequences of our results for the graph colouring problem restricted to .-free graphs.
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Algorithms and Complexity; 9th International Co Vangelis Th. Paschos,Peter Widmayer Conference proceedings 2015 Springer International Publ