Pages that link to "Item:Q3075867"
From MaRDI portal
The following pages link to Formal analysis of security protocols for wireless sensor networks (Q3075867):
Displaying 4 items.
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763) (← links)
