%0 Journal Article
%T AN O(|V|~2)ALGORITHM FOR THE PLANAR 4-CUT PROBLEM<br>平面图 4-割问题的 O(|V|~2)算法
%A ZHAO LIAN-CHANG
%A LOU HUI-YUAN
%A <br>赵连昌
%J 系统科学与数学
%D 1990
%I 
%X A 4-cut for a connected graph G is a set of edges which,When deleted,separate G into 4components.In this paper an O(|V|~2) algorithm for finding the minimum 4-cut for a planargraph G is presented.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=393B9925AAFA6B73E25C2A28EA418BC4&yid=8D39DA2CB9F38FD0&vid=F3090AE9B60B7ED1&iid=CA4FD0336C81A37A&sid=9ABA9D4EC2E0E82E&eid=6A730FEC4771F339&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0