Pages that link to "Item:Q4420970"
From MaRDI portal
The following pages link to A new class of efficient algorithms for reconfiguration of memory arrays (Q4420970):
Displaying 4 items.
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs (Q5425488) (← links)
