黄油没有
发表于 2025-3-23 10:44:49
https://doi.org/10.1007/978-3-642-55076-8o . such that the resulting graph fulfills a certain property. For example, the . problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social
PLE
发表于 2025-3-23 16:30:27
https://doi.org/10.1007/978-3-658-04680-4that . for every edge .. We survey known results on the computational complexity of . for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of o
HARD
发表于 2025-3-23 20:55:17
https://doi.org/10.1007/978-3-322-87480-1r several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers (ADMs) and regenerators.
aesthetician
发表于 2025-3-24 01:36:46
http://reply.papertrans.cn/39/3881/388021/388021_14.png
Mystic
发表于 2025-3-24 03:33:03
https://doi.org/10.1007/978-3-642-79368-4own that deciding whether a set . is secure in a graph is .-complete. However, it is still open how this result contributes to the actual complexity of deciding whether, for a given graph . and integer ., a non-empty secure set for . of size at most . exists. While membership in the class . is rathe
欲望小妹
发表于 2025-3-24 06:30:36
http://reply.papertrans.cn/39/3881/388021/388021_16.png
Serenity
发表于 2025-3-24 10:54:53
http://reply.papertrans.cn/39/3881/388021/388021_17.png
Prognosis
发表于 2025-3-24 18:11:56
http://reply.papertrans.cn/39/3881/388021/388021_18.png
extrovert
发表于 2025-3-24 20:43:04
http://reply.papertrans.cn/39/3881/388021/388021_19.png
无目标
发表于 2025-3-24 23:36:01
http://reply.papertrans.cn/39/3881/388021/388021_20.png