Simple DFS on the complement of a graph and on partially complemented digraphs

Authors

Benson Joeris, University of Waterloo
Nathan Lindzey, Colorado State University
Ross M. McConnell, Department of Computer Science
Nissa Osheim, Department of Computer Science

Abstract

Depth-first search; Graph algorithms; Graph traversal; Partially complemented digraphs

Publication Title

Information Processing Letters

Recommended Citation

Joeris, B., Lindzey, N., McConnell, R., & Osheim, N. (2017). Simple DFS on the complement of a graph and on partially complemented digraphs. Information Processing Letters, 117, 35-39. https://doi.org/10.1016/j.ipl.2016.08.006