Invertibility of digraphs and tournaments
For an oriented graph D and a set X ⊆ V (D), the inversion of X in D is the digraph obtained by reversing the orientations of the edges of D with both endpoints in X. The inversion number of D, inv(D), is the minimum number of inversions which can be applied in turn to D to produce an acyclic digrap...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics
2024
|