6533b834fe1ef96bd129d486
RESEARCH PRODUCT
Tree automata, tree decomposition and hyperedge replacement
Clemens Lautemannsubject
Discrete mathematicsSPQR treeSpanning treeK-ary treeComputer scienceTree decompositionCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTree structureGomory–Hu treeTree automatonGraph propertyComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICSdescription
Recent results concerning efficient solvability of graph problems on graphs with bounded tree-width and decidability of graph properties for hyperedge-replacement graph grammars are systematised by showing how they can be derived from recognisability of corresponding tree classes by finite tree automata, using only well-known techniques from tree-automata theory.
year | journal | country | edition | language |
---|---|---|---|---|
2005-11-22 |