机译:最大r-正则诱导连通子图问题的不可逼近*
The authqr is with the Department of Information Science,Kyushu Sangyo University, Fukuoka-shi, 813-8503 Japan;
The authors are with the Department of System Design and Informatics, Kyushu Institute of Technology, Iizuka-shi, 820-8502 Japan;
The authors are with the Department of System Design and Informatics, Kyushu Institute of Technology, Iizuka-shi, 820-8502 Japan;
induced connected subgraph; regularity; NP-hardness; inapproximability;
机译:最大 r i>-正则诱导连通子图问题的不可逼近
机译:最大r规则引发的子图问题:快速指数算法和组合界
机译:改进了最大$ k $可着色子图的不可逼近结果
机译:最大r-常规诱导的子图问题的不可估量
机译:枚举所有连通诱导子图的线性延迟算法
机译:枚举所有连接的诱导子图的线性延迟算法
机译:最小双解问题的不可近似性,小集扩张假设的最小k-切割和最密集的最小-k-子图