"Efficient algorithms for finding the (k, l)-core of tree networks."

Ronald I. Becker et al. (2002)

> Home

Details and statistics

DOI: 10.1002/NET.10051

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/BeckerLSS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BeckerLSS02
Ronald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari:
Efficient algorithms for finding the (k, l)-core of tree networks. Networks 40(4): 208-215 (2002)

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.