%0 Journal Article
%T GRAPH SEPARATION IS NP-COMPLETE FOR 3-REGULAR GRAPHS<br>3-正则图的分割问题是NP-完全问题
%A Diao Kefeng
%A <br>刁科凤
%A 李继乾
%A 王志雄
%A 周惠山
%J 系统科学与数学
%D 2003
%I 
%X We prove that both the minimum bisection problem and minimum a-separation problem are NP-complete for 3-regular graphs.
%K NP-complete
%K minimum bisection problem
%K minimum a- separation problem<br>NP-完全问题
%K 图的最小平分问题
%K 图的最小α-分割问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=242B0B01DEBE0DE3&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=CA4FD0336C81A37A&sid=EE5DE9DF0082DA88&eid=A62F867A700FCA33&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=3