Compression with wildcards: All induced metric subgraphs
<|reference_start|>Compression with wildcards: All induced metric subgraphs: Driven by applications in the natural, social and computer sciences several algorithms have been proposed to enumerate all sets $X$ of vertices of a graph $G$ that induce a connected subgraph. Our algorithm AllMetricSets enumerates all $X$'s that induce (more exquisite) metric subgraphs. Here "metric" means that any distinct $s,t\in X$ are joined by a globally shortest $s-t$ path.<|reference_end|>
@article{wild2024compression,
    title={Compression with wildcards: All induced metric subgraphs},
    author={Marcel Wild},
    journal={arXiv preprint arXiv:2409.08363},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08363},
    primaryClass={math.CO cs.DS}
}