AMITY
发表于 2025-3-23 11:17:52
http://reply.papertrans.cn/59/5801/580048/580048_11.png
亲密
发表于 2025-3-23 15:21:00
http://reply.papertrans.cn/59/5801/580048/580048_12.png
cardiac-arrest
发表于 2025-3-23 21:29:54
http://reply.papertrans.cn/59/5801/580048/580048_13.png
Rotator-Cuff
发表于 2025-3-23 22:14:24
Graph Hamiltonicity Parameterized by Proper Interval Deletion Settive integer . and the task is to check if there are . vertex-disjoint paths (cycles) that together visit all the vertices of the graph exactly once. . and . remain .-hard even when restricted to chordal graphs (Information Processing Letters 1986) but are polynomial-time solvable on proper interval
Interdict
发表于 2025-3-24 05:38:48
http://reply.papertrans.cn/59/5801/580048/580048_15.png
THE
发表于 2025-3-24 08:14:13
Structural Parameterizations for Equitable Coloringic . is fixed parameter tractable under well established parameters such as pathwidth and feedback vertex set, equitable coloring is W-hard. We prove that . is fixed parameter tractable when parameterized by distance to cluster or co-cluster graphs, improving on the FPT algorithm of Fiala et al.
雕镂
发表于 2025-3-24 11:24:15
http://reply.papertrans.cn/59/5801/580048/580048_17.png
拍翅
发表于 2025-3-24 16:59:18
http://reply.papertrans.cn/59/5801/580048/580048_18.png
榨取
发表于 2025-3-24 22:21:46
http://reply.papertrans.cn/59/5801/580048/580048_19.png
syring
发表于 2025-3-25 03:13:14
Query Minimization Under Stochastic Uncertaintyadaptive decision tree to find a correct solution to the problem in consideration while minimizing the expected total query cost. We show that sorting in this scenario can be performed in polynomial time, while finding the data item with minimum value seems to be hard. This contradicts intuition, si