3 research outputs found
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs
A complementation operation on a vertex of a digraph changes all outgoing
arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented
digraph is a digraph obtained from a sequence of vertex
complement operations on . Dahlhaus et al. showed that, given an
adjacency-list representation of , depth-first search (DFS) on
can be performed in time, where is the number of
vertices and is the number of edges in . To
achieve this bound, their algorithm makes use of a somewhat complicated
stack-like data structure to simulate the recursion stack, instead of
implementing it directly as a recursive algorithm. We give a recursive
algorithm that uses no complicated data-structures