default search action

combined dblp search
author search
venue search
publication search

ask others

"Partitioning a graph of bounded tree-width to connected subgraphs of ..."

Takehiro Ito, Xiao Zhou, Takao Nishizeki (2006)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2005.01.005

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/ItoZN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/ItoZN06
Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J. Discrete Algorithms 4(1): 142-154 (2006)

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.