Part of the Computer Sciences Commons
Lower Bounds on Paraclique Density, Ronald D. Hagan, Michael A. Langston, Kai Wang Kai Wang
Lower Bounds on Paraclique Density, Ronald D. Hagan, Michael A. Langston, Kai Wang Department of Computer Science Faculty Publications
Link
Toward an Efficient, Highly Scalable Maximum Clique Solver for Massive Graphs, Ronald D. Hagan, Charles A. Philips, Kai Wang, Gary L. Rogers, Michael A. Langston Kai Wang
On the Relative Significance of Kernelization versus Branching for Parallel FPT Implementations, Ronald D. Hagan, Charles A. Philips, Kai Wang, Gary L. Rogers, Callum Lowcay, Michael A. Langston Kai Wang
Advanced Search