CAND
发表于 2025-3-26 22:03:57
http://reply.papertrans.cn/39/3881/388034/388034_31.png
HALL
发表于 2025-3-27 03:45:53
https://doi.org/10.1007/978-3-0348-8948-3e speed of hereditary graph properties to the Bell number . and provides a partial characterisation of the family of minimal classes whose speed is at least .. In the present paper, we give a complete characterisation of this family. Since this family is infinite, the decidability of the problem of
eustachian-tube
发表于 2025-3-27 05:33:46
http://reply.papertrans.cn/39/3881/388034/388034_33.png
Hdl348
发表于 2025-3-27 11:50:24
Deepak Bhatnagar,Thomas E. Clevelandmal induced matchings, and this bound is best possible. We prove that every .-vertex triangle-free graph has at most . maximal induced matchings, and this bound is attained by every disjoint union of copies of the complete bipartite graph .. Our result implies that all maximal induced matchings in a
饶舌的人
发表于 2025-3-27 14:42:11
https://doi.org/10.1007/978-94-011-4928-0le to transform . into . by adding and removing vertices one-by-one, while maintaining an independent set of size at least . throughout? This problem is known to be PSPACE-hard in general. For the case that . is a cograph on . vertices, we show that it can be solved in polynomial time. More generall
驾驶
发表于 2025-3-27 19:57:22
http://reply.papertrans.cn/39/3881/388034/388034_36.png
Nomadic
发表于 2025-3-28 01:10:06
Topics in Molecular and Structural Biologyes the search for special structural properties of .-free graphs, including alternative characterizations..Let . be a connected .-free graph, .. We show that . admits a connected dominating set whose induced subgraph is either .-free, or isomorphic to .. Surprisingly, it turns out that every minimum
勤勉
发表于 2025-3-28 05:58:53
https://doi.org/10.1007/978-1-349-12356-8 and horizontal segments. It is known that such representations can be drawn in linear time, we here wonder whether it is as easy to decide whether a partial representation can be completed to a representation of the whole graph. We show that in each of the cases above, this problem becomes NP-hard.
有发明天才
发表于 2025-3-28 09:56:21
Molecular Aspects of Cancer and its Therapy collects a maximum number of distinct labels. Our main results are a .-approximation algorithm for this problem and a self-reduction showing that any constant ratio approximation algorithm for this problem can be converted into a PTAS. This last result, combined with the .-hardness of the problem,
Enervate
发表于 2025-3-28 12:35:42
http://reply.papertrans.cn/39/3881/388034/388034_40.png