在无向图中枚举所有的生成树——一种新颖的方法

2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD) Pub Date : 2010-12-17 DOI:10.1109/SM2ACD.2010.5672365

Cristian E. Onete, M. Onete

{"title":"在无向图中枚举所有的生成树——一种新颖的方法","authors":"Cristian E. Onete, M. Onete","doi":"10.1109/SM2ACD.2010.5672365","DOIUrl":null,"url":null,"abstract":"In this paper, we use a modified version of the incidence matrix of an un-oriented graph so as to enumerate all the spanning trees. In particular, we formally describe the problem and then enumerate the spanning trees, also Showing how to use this method in finding the symbolic determinant of a passive circuit.","PeriodicalId":442381,"journal":{"name":"2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Enumerating all the spanning trees in an un-oriented graph - A novel approach\",\"authors\":\"Cristian E. Onete, M. Onete\",\"doi\":\"10.1109/SM2ACD.2010.5672365\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we use a modified version of the incidence matrix of an un-oriented graph so as to enumerate all the spanning trees. In particular, we formally describe the problem and then enumerate the spanning trees, also Showing how to use this method in finding the symbolic determinant of a passive circuit.\",\"PeriodicalId\":442381,\"journal\":{\"name\":\"2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SM2ACD.2010.5672365\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SM2ACD.2010.5672365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文采用改进的无向图关联矩阵来枚举所有的生成树。特别地，我们形式化地描述了这个问题，然后列举了生成树，并展示了如何使用这种方法来寻找无源电路的符号行列式。

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

查看原文本刊更多论文

Enumerating all the spanning trees in an un-oriented graph - A novel approach

In this paper, we use a modified version of the incidence matrix of an un-oriented graph so as to enumerate all the spanning trees. In particular, we formally describe the problem and then enumerate the spanning trees, also Showing how to use this method in finding the symbolic determinant of a passive circuit.

求助全文

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

来源期刊

2010 XIth International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design (SM2ACD)

自引率

0.00%

发文量