PreprintLicence not statedHAL
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
Related
- Treewidth and the complexity of box-constrained quadratic programs
- Fuzzy group identification problems
- Linear and non-linear thermal system identification based on the integral of non-integer order — Application to solve inverse heat conduction linear and non-linear problems
- Exact Likelihood-Coin Poisson Sampling for Bayesian Inverse Problems with Sharp Complexity Bounds
- Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems
BibTeX
@misc{berthe2026neighbourhood,
title = {{Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth}},
author = {Gaétan Berthe and Florent Foucaud and Tuomo Lehtilä and Aline Parreau},
howpublished = {HAL},
year = {2026},
month = jul,
eprint = {2607.16889},
archivePrefix = {arXiv},
url = {https://hal.science/hal-05765919v1},
}
RIS
TY - UNPB
TI - Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
AU - Gaétan Berthe
AU - Florent Foucaud
AU - Tuomo Lehtilä
AU - Aline Parreau
PY - 2026
DA - 2026/07/18
PB - HAL
UR - https://hal.science/hal-05765919v1
ER -