Pages that link to "Item:Q860400"
From MaRDI portal
The following pages link to NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400):
Displaying 2 items.
The following pages link to NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400):
Displaying 2 items.