Pages that link to "Item:Q3163890"
From MaRDI portal
The following pages link to On Symbolic Representations of Maximum Matchings and (Un)directed Graphs (Q3163890):
Displaying 7 items.
- 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)
- The symbolic algorithms for maximum flow in networks (Q2433386) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059) (← links)
- (Q3007864) (← links)