{"title":"Compression with wildcards: All induced metric subgraphs","authors":"Marcel Wild","doi":"arxiv-2409.08363","DOIUrl":null,"url":null,"abstract":"Driven by applications in the natural, social and computer sciences several\nalgorithms have been proposed to enumerate all sets $X$ of vertices of a graph\n$G$ that induce a connected subgraph. Our algorithm AllMetricSets enumerates\nall $X$'s that induce (more exquisite) metric subgraphs. Here \"metric\" means\nthat any distinct $s,t\\in X$ are joined by a globally shortest $s-t$ path.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"16 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
