On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.
Klaus MeerDieter RautenbachPublished in: IWPEC (2006)
Keyphrases
- bounded degree
- maximal cliques
- maximum clique
- maximal clique enumeration
- bounded treewidth
- graph theoretic
- graph theory
- graph structure
- maximum weight
- boolean functions
- graph matching
- tree structure
- spanning tree
- graph properties
- social networks
- tree structures
- protein interaction networks
- branch and bound algorithm
- b tree
- model checking
- independent set
- uniform random
- index structure