Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the complexity of partitioning a graph into a few connected subgraphs."

Julien Bensmail (2015)

> Home

Details and statistics

DOI: 10.1007/S10878-013-9642-8

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Bensmail15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Bensmail15
Julien Bensmail:
On the complexity of partitioning a graph into a few connected subgraphs. J. Comb. Optim. 30(1): 174-187 (2015)

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.