Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Finding densest k-connected subgraphs."

Francesco Bonchi et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2021.08.032

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/BonchiGMT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BonchiGMT21
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding densest k-connected subgraphs. Discret. Appl. Math. 305: 34-47 (2021)

a service of

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.