"Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter."

Parinya Chalermsook et al. (2024)

> Home

Details and statistics

DOI: 10.1145/3632623

access: closed

type: Journal Article

metadata version: 2024-02-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/ChalermsookKMSUV24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/ChalermsookKMSUV24
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (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.