"An O(k 2n2) algorithm to find a k ..."

Jun Ma, Shaohan Ma (1994)

> Home

Details and statistics

DOI: 10.1007/BF02939489

access: closed

type: Journal Article

metadata version: 2022-10-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcst/MaM94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcst/MaM94
Jun Ma, Shaohan Ma:
An O(k ²n²) algorithm to find a k -partition in a k -connected graph. J. Comput. Sci. Technol. 9(1): 86-91 (1994)

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.