Two constrained recognition problems for oriented interval graphs are solved in linear time, improving a prior quadratic algorithm and solving the proper/unit case.
Upward and quasi-upward planarity testing of embedded mixed graphs
1 Pith paper cite this work, alongside 17 external citations. Polarity classification is still indexing.
1
Pith paper citing it
17
external citations · OpenAlex
fields
cs.CG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Towards the Recognition of Oriented Interval Graphs
Two constrained recognition problems for oriented interval graphs are solved in linear time, improving a prior quadratic algorithm and solving the proper/unit case.