1 paper
Jordan Almeter, Samet Demircan, Andrew Kallmeyer +2
In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A rank…