A note on the size of OBDDs for the graph of integer multiplication.
Beate BolligPublished in: Inf. Process. Lett. (2008)
Keyphrases
- floating point
- computational complexity
- connected components
- integer arithmetic
- graph structure
- maximal cliques
- graph representation
- random walk
- directed graph
- boolean functions
- maximum clique
- graph theoretic
- onset detection
- search engine
- weighted graph
- space complexity
- link analysis
- graph construction
- dependency graph
- bounded treewidth
- graph based algorithm
- graph theory
- graph matching
- memory requirements