default search action

combined dblp search
author search
venue search
publication search

ask others

"On the complexity of partitioning graphs into connected subgraphs."

Martin E. Dyer, Alan M. Frieze (1985)

> Home

Details and statistics

DOI: 10.1016/0166-218X(85)90008-3

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/DyerF85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/DyerF85
Martin E. Dyer, Alan M. Frieze:
On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10(2): 139-153 (1985)

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.