PreprintLicence not statedHAL
Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
Related
- Asymptotic Theory for Restricted Maximum Likelihood Estimators in Generalized Linear Mixed Models
- Lifted Restricted Isometry Property and Fast Algorithm for Spectral Compressed Sensing With Near-Optimal Sample Complexity
- Strong Simultaneous Inference for Restricted Mean Survival Time Processes in Multi-Arm Trials under Covariate-Adaptive Randomization
- Formal solution and strong asymptotic expansion of some initial value problem in two complex time variables, infinite order irregular singularities and Mahler transforms
- Strong stable sets and asymptotic fineness
BibTeX
@misc{chakraborty2026strong,
title = {{Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations}},
author = {Dibyayan Chakraborty and Florent Foucaud},
howpublished = {HAL},
year = {2026},
month = sep,
eprint = {2501.10828},
archivePrefix = {arXiv},
url = {https://hal.science/hal-05765921v1},
}
RIS
TY - UNPB
TI - Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
AU - Dibyayan Chakraborty
AU - Florent Foucaud
PY - 2026
DA - 2026/09/27
PB - HAL
UR - https://hal.science/hal-05765921v1
ER -