Journal of Guangxi Normal University(Natural Science Edition) ›› 2011, Vol. 29 ›› Issue (1): 38-42.

Previous Articles     Next Articles

Hardness Analysis of Two Parameterization Counting Matching Problems

WEI Li, XU Dao-yun, WANG Xiao-feng   

  1. College of Computer Science and Information,Guizhou University,Guiyang Guizhou 550025,China
  • Received:2010-11-10 Published:2018-11-16

Abstract: Counting matching problem is an intractable problem.Considering its corresponding parameterized problems p-deg-#MATCHING andp-#MATCHING,p-deg-#MATCHING is proved to be fixed-parameter tractable and p-#MATCHING has a randomized approximation scheme of fixed-parameter tractable.

Key words: parameterization, counting matching problem, fixed-parameter tractable, randomized approximation scheme

CLC Number: 

  • TP301
[1] GROHE M.The parameterized complexity of database queries[C]//Proceeding of the 20th ACM Symposium on Principles of Data Systems.New York:ACM Press,2001:82-92.
[2] PAPADIMITRIOU C H,YANNAKAKIS M.On the complexity of database queries[C]//Proceeding of the 17th ACM Symposium on Principles of Data Systems.NewYork:ACM Press,1997:12-19.
[3] GOTTLOB G,LEONE N,SIDERI M.Fixed-parameter complexity in AI and nonmonotonic reasoning[C]//Logic Programming and Nonmonotonic Reasoning:LNCS Volume 1730.Berlin:Springer,1999:1-18.
[4] DOENEY R G,FELLOWS M R.Parameterized complexity[M].Berlin:Springer,1999.
[5] ARORA S,BARAK B.Computational complexity:a modern approach[M].Cambridge:Cambridge University Press,2009.
[6] VALIANT L G.The complexity of computing the permanent[J].Theoretical Computer Science,1979,8(2):189-201.
[7] TODA S.PP is as hard as the polynomial-time hierarchy[J].SIAM Journal on Computing,1991,20(5):865-877.
[8] JERRUM M,SINCLAIR A,VOGODA E.A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries[J].Journal of the ACM,2004,51(4):671-697.
[9] VAZIRANI V V.Approximation algorithms[M].Berlin:Springer,2001.
[10] FLUM J,GROHE M.The parameterized complexity of counting problems[J].SIAM Journal on Computing,2004,33(4):892-922.
[11] FLUM J,GROHE M.Parameterized complexity theory[M].Berlin:Springer,2006.
[1] XU Lunhui,HUANG Baoshan,ZHONG Haixing. Time Window Model and Algorithm with AGV System Path Planning [J]. Journal of Guangxi Normal University(Natural Science Edition), 2019, 37(3): 1-8.
[2] SHI Ya-bing, HUANG Yu, QIN Xiao, YUAN Chang-an. K-Means Clustering Algorithm Based on a Novel Approach for Improved Initial Seeds [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(4): 33-40.
[3] WENG Shi-zhou, LÜ Yue-jin, MO Jing-lan. Ranking Model and Its Order-preserving Reduction Theory Based on Dominance Relations [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(3): 37-44.
[4] CAO Yong-chun, SHAO Ya-bin, TIAN Shuang-liang, CAI Zheng-qi. A Clustering Method Based on Immune Genetic Algorithm [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(3): 59-64.
[5] ZHANG Chao-qun, ZHENG Jian-guo, LI Tao-shen. Effect of Scout Bees on the Performance of Artificial Bee Colony Algorithm [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(3): 72-80.
[6] ZHOU Yan-cong, GU Jun-hua, DONG Yong-feng. Converse Binary Anti-collision Algorithm and Hardware Implementation Based on FPGA [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(3): 94-99.
[7] XIE Guang-qiang, ZHANG Yun, LI Yang, ZENG Qi-jie. Research of Krause's Multi-Agent Consensus Model [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(3): 106-113.
[8] HUANG Min, JIN Ting, ZHONG Sheng, MA Yu-chun. Ant Colony Algorithm for Solving Continuous Function Optimization Problem Based on Pheromone Distributive Function [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(2): 34-38.
[9] ZHAI Ying, YI Zhong, XIE Zheng-wei, DENG Pei-min, LI Yue. Garden of Eden Configurations of a Particular Hybrid Transformation of Two-dimensional Cellular Automata [J]. Journal of Guangxi Normal University(Natural Science Edition), 2013, 31(1): 37-43.
[10] CUI Yao-dong, ZHOU Mi, YANG Liu. Strategies for Solving the 1D Cutting Stock Problem of Multiple Stock Lengths [J]. Journal of Guangxi Normal University(Natural Science Edition), 2012, 30(3): 149-153.
[11] MA Ning, YU Hong-zhi. Image Watermarking Algorithm Based on DCT Transform and ArnoldTransform [J]. Journal of Guangxi Normal University(Natural Science Edition), 2011, 29(3): 163-167.
[12] YE Qing, HUANG Qiang, NIE Bin, LI Huan. An Adaptive High-Dimensional Outlier Recognition Method [J]. Journal of Guangxi Normal University(Natural Science Edition), 2020, 38(2): 107-114.
[13] WANG Junjie, WEN Xueyan, XU Kesheng, YU Ming. An Improved Stack Algorithm Based on Local Sensitive Hash [J]. Journal of Guangxi Normal University(Natural Science Edition), 2020, 38(4): 21-31.
[14] WEI Zhenhan, SONG Shuxiang, XIA Haiying. State-of-charge Estimation Using Random Forest for Lithium Ion Battery [J]. Journal of Guangxi Normal University(Natural Science Edition), 2018, 36(4): 27-33.
[15] E Xu, SHAO Liang-shan, LI Sheng, WANG Quan-tie. Discretization Algorithm for Interval Numbers by Associated Degree [J]. Journal of Guangxi Normal University(Natural Science Edition), 2011, 29(2): 134-137.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!