Login / Signup
Depth-first search satisfiability of the μ-calculus with converse over trees.
Yensen Limón
Everardo Bárcenas
Edgard Benítez-Guerrero
María Auxilio Medina Nieto
Published in:
CONIELECOMP (2017)
Keyphrases
</>
depth first search
breadth first search
search tree
routing problem
branch and bound
np complete
search algorithm
computational complexity
tree search
spanning tree
data model
first order logic