"Long Term Memory and the Densest K-Subgraph Problem."

Robert Legenstein et al. (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITCS.2018.57

access: open

type: Conference or Workshop Paper

metadata version: 2021-09-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/innovations/Legenstein0PV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/innovations/Legenstein0PV18
Robert Legenstein, Wolfgang Maass, Christos H. Papadimitriou, Santosh S. Vempala:
Long Term Memory and the Densest K-Subgraph Problem. ITCS 2018: 57:1-57:15

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.