"Finding local Max-Cut in graphs in randomized polynomial time."

Lunshan Gao (2024)

> Home

Details and statistics

DOI: 10.1007/S00500-023-09230-5

access: closed

type: Journal Article

metadata version: 2024-02-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/soco/Gao24a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/Gao24a
Lunshan Gao:
Finding local Max-Cut in graphs in randomized polynomial time. Soft Comput. 28(4): 3029-3048 (2024)

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.