"Computing the Treewidth and the Minimum Fill-In with the Modular ..."

Hans L. Bodlaender, Udi Rotics (2003)

> Home

Details and statistics

DOI: 10.1007/S00453-003-1026-5

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BodlaenderR03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BodlaenderR03
Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003)

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.