On the Complexity of Recognizing Wheeler Graphs.

Daniel Gibney Sharma V. Thankachan

Published in: Algorithmica (2022)

Keyphrases

computational complexity
computational cost
worst case
graph theory
graph representation
decision trees
pattern recognition
directed graph
graph matching
bounded treewidth
polynomial time complexity