LUMEN 发表于 2025-3-30 11:14:10
http://reply.papertrans.cn/79/7813/781264/781264_51.png曲解 发表于 2025-3-30 14:58:49
http://reply.papertrans.cn/79/7813/781264/781264_52.png不规则 发表于 2025-3-30 18:23:09
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographsur main result. As a by-product of our proofs, we obtain a min-max theorem, which is worth of interest in itself, stating equality between the rank of a tree and the minimum height its path partitions.Muffle 发表于 2025-3-30 23:00:24
http://reply.papertrans.cn/79/7813/781264/781264_54.png