Maximum packing for k-connected partial k-trees in polynomial time.

Anders Dessmark Andrzej Lingas Andrzej Proskurowski

Published in: Theor. Comput. Sci. (2000)

Keyphrases

decision trees
special case
worst case
tree languages
tree models
tree structure
approximation algorithms
packing problem
computational complexity
search algorithm
labeled trees
bounded degree
maximum number
tree structures
tree construction
tree automata
information retrieval