线性平均时间正则图的正则标记

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI:10.1109/SFCS.1987.11

L. Kucera

{"title":"线性平均时间正则图的正则标记","authors":"L. Kucera","doi":"10.1109/SFCS.1987.11","DOIUrl":null,"url":null,"abstract":"An algorithm is presented to compute a canonical form of regular graphs. There is a constant c such that for each constant d the average running time of the algorithm over all d-regular graphs with N vertices is not greater than cNd, provided N is sufficiently large.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Canonical labeling of regular graphs in linear average time\",\"authors\":\"L. Kucera\",\"doi\":\"10.1109/SFCS.1987.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm is presented to compute a canonical form of regular graphs. There is a constant c such that for each constant d the average running time of the algorithm over all d-regular graphs with N vertices is not greater than cNd, provided N is sufficiently large.\",\"PeriodicalId\":153779,\"journal\":{\"name\":\"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1987.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1987.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 35

摘要

给出了正则图标准形式的一种计算算法。有一个常数c，使得对于每个常数d，算法在所有d个有N个顶点的正则图上的平均运行时间不大于nd，前提是N足够大。

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

查看原文本刊更多论文

Canonical labeling of regular graphs in linear average time

An algorithm is presented to compute a canonical form of regular graphs. There is a constant c such that for each constant d the average running time of the algorithm over all d-regular graphs with N vertices is not greater than cNd, provided N is sufficiently large.

求助全文

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

来源期刊

28th Annual Symposium on Foundations of Computer Science (sfcs 1987)

自引率

0.00%

发文量