Dynamic programming over non-redundant constraints yields 4^n time for an NP-hard IA fragment and asymptotically matches the o(n)^n bound for RCC.
Booth and George S
3 Pith papers cite this work, alongside 1,498 external citations. Polarity classification is still indexing.
3
Pith papers citing it
1,498
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Two constrained recognition problems for oriented interval graphs are solved in linear time, improving a prior quadratic algorithm and solving the proper/unit case.
Standard DFS and BFS suffice to recognize and certify trivially perfect graphs, split graphs, bipartite chain graphs, and proper interval graphs using pattern-avoiding vertex orderings.
citing papers explorer
-
Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
Dynamic programming over non-redundant constraints yields 4^n time for an NP-hard IA fragment and asymptotically matches the o(n)^n bound for RCC.
-
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.
-
On the power of standard DFS and BFS
Standard DFS and BFS suffice to recognize and certify trivially perfect graphs, split graphs, bipartite chain graphs, and proper interval graphs using pattern-avoiding vertex orderings.