Pages that link to "Item:Q5902005"
From MaRDI portal
The following pages link to SOFSEM 2004: Theory and Practice of Computer Science (Q5902005):
Displaying 15 items.
- On the OBDD representation of some graph classes (Q317396) (← 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)
- Lower bounds on the OBDD size of two fundamental functions' graphs (Q845898) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Exponential space complexity for OBDD-based reachability analysis (Q1675755) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- Symbolic topological sorting with OBDDs (Q2465997) (← links)
- Symbolic graphs: Linear solutions to connectivity related problems (Q2471809) (← links)
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)