Planarity can be verified by an approximate proof labeling scheme in constant-time.

Published in: J. Comb. Theory, Ser. A (2022)

Keyphrases

labeling scheme
xml documents
transitive closure
xml data
xml queries
directed acyclic graph
parent child
machine learning
decision trees
search engine
keywords
xml databases
efficient processing
insertions and deletions