Skip to content
DraconiticResearch
Search Sources API
182,549 studies31 sourcesUpdated 46 min ago
PreprintLicence not statedHAL

Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth

Related

  1. Treewidth and the complexity of box-constrained quadratic programs
    Alberto Del Pia, Aida Khajavirad
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Fuzzy group identification problems
    Federico Fioravanti, Fernando Tohmé
    Fuzzy Sets and SystemsPeer-reviewedLicence not statedFull text2 citedGeneral mathematicsHAL
  3. 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
    Jean-Luc Battaglia
    International Journal of Thermal SciencesPeer-reviewedLicence not stated7 citedMathematical physicsHAL
  4. Exact Likelihood-Coin Poisson Sampling for Bayesian Inverse Problems with Sharp Complexity Bounds
    Zhiliang Deng, Xiaomei Yang
    arXivPreprintCC BY-NC-SA 4.0Full textProbabilityStatisticsarXiv
  5. Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems
    Jingyao Wang, Yanqiao Wang, Bowen Li +2
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
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  -