The DFS approach is an applicable linearization of trees since a recursive traversal, which starts at the root and explores all outgoing edges, is guaranteed to visit all of the graph's nodes.
dFS linearization is not directly applicable to SdP, as its graphs often consist of several non-connected components.