default search action
"Np-hardness proof and an approximation algorithm for the minimum vertex ..."
Keizo Miyata et al. (2006)
- Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao:
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. Discret. Appl. Math. 154(16): 2402-2410 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.