An algorithm with a delay of O(kΔ) for enumerating connected induced subgraphs of size k
Information and Computation · 2026-06 · 311 · 105452
DOI: 10.1016/j.ic.2026.105452 ↗Kurz gefasst
Fachartikel in der Zeitschrift Information and Computation, 2026-06. Verfasst von Chenglong Xiao und 2 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: Guangdong Provincial Natural Science Foundation, Basic and Applied Basic Research Foundation of Guangdong Province, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Guangdong Provincial Natural Science Foundation
- Basic and Applied Basic Research Foundation of Guangdong Province
- National Natural Science Foundation of China
Zitieren
APA
Xiao, C., Mao, C., & Wang, S. (2026). An algorithm with a delay of O(kΔ) for enumerating connected induced subgraphs of size k. Information and Computation, 311, 105452. https://doi.org/10.1016/j.ic.2026.105452
Vancouver
Xiao C, Mao C, Wang S. An algorithm with a delay of O(kΔ) for enumerating connected induced subgraphs of size k. Information and Computation. 2026;311:105452. doi:10.1016/j.ic.2026.105452
BibTeX
@article{Xiao2026,
author = {Xiao, Chenglong and Mao, Chengyong and Wang, Shanshan},
title = {An algorithm with a delay of O(kΔ) for enumerating connected induced subgraphs of size k},
journal = {Information and Computation},
year = {2026},
volume = {311},
pages = {105452},
doi = {10.1016/j.ic.2026.105452}
}
EUVIMED