Determine the computational complexity and approximability of unresolved parameters
Determine the computational complexity of computing the two graph parameters identified by the paper as unresolved in item 3, and establish whether non-trivial inapproximability results hold for those parameters.
References
What is the complexity of computing $(G),$ $(G)$}? Can non-trivial inapproximability results be obtained for those hard to compute parameters?
— Graph parameters that are coarsely equivalent to path-length
(2503.05661 - Dragan et al., 7 Mar 2025) in Section 5, “Concluding remarks and open questions,” item 3
Show NP-hardness results for the pp-rank of a given graph or the eventual pp-increasing-rank of a given graph.
— Graphs with Bounded Push-Pop Walk Orderings
(2610.19724 - Amarilli et al., 14 Oct 2026) in Appendix, Section “Open Problems,” subsection “Complexity of Computing Graph Ranks”