+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Say that an n-vertex directed acyclic graph is compact if there is some way of numbering the…

Say that an n-vertex directed acyclic graph is compact if there is some way of numbering the…

Say that an n-vertex directed acyclic graph  is compact if there is some way of numbering the vertices of  with the integers from 0 to n−1 such that  contains the edge (i, j) if and only if i 2)-time algorithm for detecting if  is compact.