default search action
"A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph ..."
Hiroshi Nagamochi, Toshihide Ibaraki (1992)
- Hiroshi Nagamochi, Toshihide Ibaraki:
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica 7(5&6): 583-596 (1992)
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.