[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Polynomial time algorithms for the MIN CUT problem on degree restricted trees

Chung, Moon-Jung; Chung, Moon-Jung; Chung, Moon-Jung; Chung, Moon-Jung; Makedon, Fillia; Makedon, Fillia; Makedon, Fillia; Makedon, Fillia; Sudborough, Ivan Hal; Sudborough, Ivan Hal; Sudborough, Ivan Hal; Sudborough, Ivan Hal; Turner, Jonathan; Turner, Jonathan; Turner, Jonathan; Turner, Jonathan

作者Chung, Moon-Jung; Chung, Moon-Jung; Chung, Moon-Jung; Chung, Moon-Jung; Makedon, Fillia; Makedon, Fillia; Makedon, Fillia; Makedon, Fillia; Sudborough, Ivan Hal; Sudborough, Ivan Hal; Sudborough, Ivan Hal; Sudborough, Ivan Hal; Turner, Jonathan; Turner, Jonathan; Turner, Jonathan; Turner, Jonathan
文件大小1323.59KB
发表时间1982
DOI10.1109/sfcs.1982.85
页码262-271

发现好书期刊，享受阅读乐趣

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Polynomial time algorithms for the MIN CUT problem on degree restricted trees