固定顶点集上的多集论图的度量

Proceedings of the 2020 3rd International Conference on Mathematics and Statistics Pub Date : 2020-06-21 DOI:10.1145/3409915.3409917

Ray-Ming Chen

{"title":"固定顶点集上的多集论图的度量","authors":"Ray-Ming Chen","doi":"10.1145/3409915.3409917","DOIUrl":null,"url":null,"abstract":"In this article, we show how to define distance functions for multi-edged graphs, either with vertices being labelled or unlabelled. These metrics are constructed mainly based on the minimal matching for multi-sets. In the end, we implement such metrics based on adjacent matrices. These metrics provide some important applications in the real world.","PeriodicalId":114746,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Metrics for Multi-Set-Theoretic Graphs over Fixed Set of Vertices\",\"authors\":\"Ray-Ming Chen\",\"doi\":\"10.1145/3409915.3409917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we show how to define distance functions for multi-edged graphs, either with vertices being labelled or unlabelled. These metrics are constructed mainly based on the minimal matching for multi-sets. In the end, we implement such metrics based on adjacent matrices. These metrics provide some important applications in the real world.\",\"PeriodicalId\":114746,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3409915.3409917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Mathematics and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3409915.3409917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们将展示如何定义多边图的距离函数，无论是标记顶点还是未标记顶点。这些指标主要是基于多集的最小匹配来构建的。最后，我们基于相邻矩阵实现了这些度量。这些指标在现实世界中提供了一些重要的应用。

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

查看原文本刊更多论文

Metrics for Multi-Set-Theoretic Graphs over Fixed Set of Vertices

In this article, we show how to define distance functions for multi-edged graphs, either with vertices being labelled or unlabelled. These metrics are constructed mainly based on the minimal matching for multi-sets. In the end, we implement such metrics based on adjacent matrices. These metrics provide some important applications in the real world.

求助全文

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

来源期刊

Proceedings of the 2020 3rd International Conference on Mathematics and Statistics

自引率

0.00%

发文量