首页 | 本学科首页   官方微博 | 高级检索  
     


An O(n^4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
Authors:Andreas Emil Feldmann  Peter Widmayer
Affiliation:1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada
2. Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland
Abstract:
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号