On the OBDD size for graphs of bounded tree- and clique-width.
Klaus MeerDieter RautenbachPublished in: Discret. Math. (2009)
Keyphrases
- bounded degree
- maximal cliques
- maximum clique
- maximal clique enumeration
- bounded treewidth
- maximum weight
- boolean functions
- graph theoretic
- independent set
- graph properties
- graph theory
- spanning tree
- tree structure
- graph structure
- tree structured data
- association graph
- model checking
- graph matching
- lower bound
- tree structures
- complex networks
- polynomial size
- index structure
- np complete
- graphical models