斜谷
发表于 2025-3-23 10:40:55
https://doi.org/10.1007/978-1-4615-0221-0anners of size .(log .), where . is the diameter of .,.– interval graphs have a 1-spanner with fewer than 2. – 2 edges..Furthermore, at the end of the paper we state other results on collective tree c-spanners for . > 1 and other more general graph classes.
Bumble
发表于 2025-3-23 14:17:19
Modern Trends in Applied Terrestrial Ecologys, and for planar line graphs. Now, the computational complexity of the stable cutset problem restricted to claw-free graphs and claw-free planar graphs is known for all bounds on the maximum degree..Moreover, we prove that the stable cutset problem remains .-complete for ..-free planar graphs of maximum degree five.
Dna262
发表于 2025-3-23 21:03:37
http://reply.papertrans.cn/39/3881/388018/388018_13.png
伦理学
发表于 2025-3-24 00:38:33
http://reply.papertrans.cn/39/3881/388018/388018_14.png
遣返回国
发表于 2025-3-24 04:42:17
http://reply.papertrans.cn/39/3881/388018/388018_15.png
CAGE
发表于 2025-3-24 09:44:51
Roman Domination over Some Graph Classesumber of an interval graph can be computed in linear time. We also show that the Roman domination number of a cograph can be computed in linear time. Besides, we show that there are polynomial time algorithms for computing the Roman domination numbers of AT-free graphs and graphs with a .-octopus.
猛击
发表于 2025-3-24 12:29:49
http://reply.papertrans.cn/39/3881/388018/388018_17.png
诗集
发表于 2025-3-24 18:12:43
http://reply.papertrans.cn/39/3881/388018/388018_18.png
轨道
发表于 2025-3-24 22:42:46
http://reply.papertrans.cn/39/3881/388018/388018_19.png
corn732
发表于 2025-3-25 02:17:18
http://reply.papertrans.cn/39/3881/388018/388018_20.png