Pages that link to "Item:Q671612"
From MaRDI portal
The following pages link to On the effect of local changes in the variable ordering of ordered decision diagrams (Q671612):
Displaying 20 items.
- Worst case examples for operations on OBDDs (Q294746) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Design of experiments and evaluation of BDD ordering heuristics (Q1606809) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Using ordered binary decision diagrams to factorize multi-level logic (Q1922609) (← links)
- Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- On the structure of counterexamples to symmetric orderings for BDD's (Q2841260) (← links)
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059) (← links)
- Embryonic genetic algorithm with random generational growing strategy for optimizing variable ordering of BDDS (Q2903851) (← links)
- BDD Ordering Heuristics for Classical Planning (Q2938478) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- Foundations of Genetic Algorithms (Q5703881) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
- Experimental and theoretical analysis of local search optimising OBDD variable orderings (Q6635986) (← links)
