上腭
发表于 2025-3-23 12:36:40
http://reply.papertrans.cn/16/1532/153172/153172_11.png
食料
发表于 2025-3-23 15:20:45
http://reply.papertrans.cn/16/1532/153172/153172_12.png
flavonoids
发表于 2025-3-23 18:45:03
Kunst und Management werden neu kooperieren,omial-time solvable for path (triad)-convex split graphs with convexity on ., and circular-convex split graphs. Finally, we show that STREE can be used as a framework for the dominating set problem in split graphs, and hence the complexity of STREE and the dominating set problem is the same for all these graph classes.
dendrites
发表于 2025-3-23 23:35:54
http://reply.papertrans.cn/16/1532/153172/153172_14.png
剥削
发表于 2025-3-24 03:37:30
http://reply.papertrans.cn/16/1532/153172/153172_15.png
Vasoconstrictor
发表于 2025-3-24 06:59:46
http://reply.papertrans.cn/16/1532/153172/153172_16.png
LINE
发表于 2025-3-24 13:51:09
https://doi.org/10.1007/978-3-531-92168-6 on both graphs and posets. In this paper, the C-I graphs, which are also comparability graphs are studied. We identify the class of comparability C-I graphs, which are Ptolemaic graphs, cographs, chordal cographs, distance-hereditary and bisplit graphs. We also determine the posets of these C-I graphs.
ANTH
发表于 2025-3-24 17:35:44
https://doi.org/10.1007/978-3-642-91696-0spectively. We reduce the maximum degree to . in both cases: i.e., . and . are NP-complete for graphs of maximum degree four. We also show that for all . and ., the time complexity of .-. is the same for graphs of maximum degree . and .-regular graphs (i.e., the problem is either in P for both classes or NP-complete for both classes).
弯曲道理
发表于 2025-3-24 22:44:47
https://doi.org/10.1007/978-3-642-51838-6d a distance function, in order to differentiate the computed subgraphs. We show that the first variant of the problem is solvable in polynomial time, for any .. For the second variant, which is NP-hard for ., we present an approximation algorithm that achieves a factor of ..
先兆
发表于 2025-3-25 01:14:34
http://reply.papertrans.cn/16/1532/153172/153172_20.png