Author:
Donovan Zola,Gutin Gregory,Mkrtchyan Vahan,Subramani K.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference19 articles.
1. Bang-Jensen J, Gutin G (2010) Digraphs: theory algorithms and applications. Springer, London
2. Bui TN, Jones C (1989) Sequential and parallel algorithms for partitioning simple classes of graphs. Technical report, Department of Computer Science, The Pennsylvania State University, University Park, Pennsylvania
3. Bui TN, Chaudhuri S, Leighton FT, Sipser M (1987) Graph bisection algorithms with good average case behavior. Combinatorica 7(2):171–191
4. Cong J, Romesis M (2001) Performance-driven multi-level clustering with application to hierarchical FPGA mapping. In: Proceedings of the 38th design automation conference (IEEE Cat. No. 01CH37232), pp 389–394
5. Denman R, Foster S (2009) Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Appl Math 157(7):1655–1659
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献