"Computing the Largest Bond and the Maximum Connected Cut of a Graph."

Gabriel L. Duarte et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00789-1

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DuarteEHKKLPSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DuarteEHKKLPSS21
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021)

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.