用通配符压缩所有诱导度量子图

Marcel Wild
{"title":"用通配符压缩所有诱导度量子图","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

在自然科学、社会科学和计算机科学应用的推动下,人们提出了几种算法来枚举图 G$ 的所有顶点集合 $X$,这些集合会诱发一个连通的子图。我们的算法 AllMetricSets 可以枚举出所有诱发(更精致的)度量子图的 $X$。这里的 "度量 "是指 X$ 中任何不同的$s,t$都由一条全局最短的$s-t$路径连接。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信