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

arXiv - MATH - Combinatorics Pub Date : 2024-09-12 DOI:arxiv-2409.08363

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":"16 1","pages":""},"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\":\"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}","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$路径连接。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - MATH - Combinatorics

自引率

0.00%

发文量

期刊最新文献

A note on connectivity in directed graphs Proof of a conjecture on graph polytope Generalized Andrásfai--Erdős--Sós theorems for odd cycles The repetition threshold for ternary rich words Isomorphisms of bi-Cayley graphs on generalized quaternion groups