A characterization of direction-monotone spanning trees leads to fixed-parameter polynomial algorithms for shortest monotone spanning trees and to a degree lower bound of 2k.
An algorithm to construct greedy drawings of triangulations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Minimum Monotone Spanning Trees
A characterization of direction-monotone spanning trees leads to fixed-parameter polynomial algorithms for shortest monotone spanning trees and to a degree lower bound of 2k.