Special tree-width and the verification of monadic second-order graph pr operties - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Special tree-width and the verification of monadic second-order graph pr operties

Résumé

Automata for checking monadic second-order graph properties with edge quantifications are easy to construct for graphs of bounded special tree-width
Fichier non déposé

Dates et versions

hal-00646524 , version 1 (30-11-2011)

Identifiants

  • HAL Id : hal-00646524 , version 1

Citer

Bruno Courcelle. Special tree-width and the verification of monadic second-order graph pr operties. FSTTCS 2010, Dec 2010, Chennai, India. ⟨hal-00646524⟩

Collections

CNRS ANR
97 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More