Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference19 articles.
1. Two open problems in communication in edge-disjoint paths modes;Böckenhauer;Acta Mathematica et Informatica Universitatis Ostraviensis,1999
2. Vertex bisection is hard, too;Brandes;Journal of Graph Algorithms and Applications,2009
3. An exact combinatorial algorithm for minimum graph bisection;Delling;Mathematical Programming,2015
4. A survey of graph layout problems;Díaz;ACM Computing Surveys,2002
5. Variable neighborhood search for the vertex separation problem;Duarte;Computers & Operations Research,2012
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献