Pages that link to "Item:Q412342"
From MaRDI portal
The following pages link to A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342):
Displaying 10 items.
- Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- On computing an optimal semi-matching (Q2408093) (← links)
- Deadlock resolution in wait-for graphs by vertex/arc deletion (Q2420655) (← links)
- An extension of Hall's theorem for partitioned bipartite graphs (Q2630339) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- On Computing an Optimal Semi-matching (Q3104781) (← links)
- The existence of universally agreed fairest semi-matchings in any given bipartite graph (Q5918112) (← links)
