This complexity does not affect path - finding algorithms for skew - symmetric graphs .
These algorithms assume that the skew - symmetric structure is given as part of the input to the algorithm rather than requiring it to be inferred from the graph alone .
This complexity does not affect path - finding algorithms for skew - symmetric graphs , because these algorithms assume that the skew - symmetric structure is given as part of the input to the algorithm rather than requiring it to be inferred from the graph alone .