Login / Signup

Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees.

Damon Kaller
Published in: Algorithmica (2000)
Keyphrases
  • decision trees
  • databases
  • artificial intelligence
  • tree construction
  • database
  • data sets
  • relational databases
  • tree structure
  • connected components
  • binary tree
  • tree automata