"Fully Polynomial-Time Parameterized Computations for Graphs and Matrices ..."

Fedor V. Fomin et al. (2018)

> Home

Details and statistics

DOI: 10.1145/3186898

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/FominLSPW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/FominLSPW18
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms 14(3): 34:1-34:45 (2018)

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.