{"title":"利用引文索引循环策略的一些数学性质","authors":"L.J. Cummings, D.A. Fox","doi":"10.1016/0020-0271(73)90012-0","DOIUrl":null,"url":null,"abstract":"<div><p>This paper compares two types of cycling strategies possible in citation index searching. This is done using a class of pseudo-randomly generated citation digraphs whose elements have bounded bibliography size. An attempt is made to explain the results obtained using a combinatorial formula of general application to digraphs.</p></div>","PeriodicalId":100670,"journal":{"name":"Information Storage and Retrieval","volume":"9 12","pages":"Pages 713-719"},"PeriodicalIF":0.0000,"publicationDate":"1973-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0020-0271(73)90012-0","citationCount":"6","resultStr":"{\"title\":\"Some mathematical properties of cycling strategies using citation indexes\",\"authors\":\"L.J. Cummings, D.A. Fox\",\"doi\":\"10.1016/0020-0271(73)90012-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper compares two types of cycling strategies possible in citation index searching. This is done using a class of pseudo-randomly generated citation digraphs whose elements have bounded bibliography size. An attempt is made to explain the results obtained using a combinatorial formula of general application to digraphs.</p></div>\",\"PeriodicalId\":100670,\"journal\":{\"name\":\"Information Storage and Retrieval\",\"volume\":\"9 12\",\"pages\":\"Pages 713-719\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0020-0271(73)90012-0\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Storage and Retrieval\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0020027173900120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Storage and Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0020027173900120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some mathematical properties of cycling strategies using citation indexes
This paper compares two types of cycling strategies possible in citation index searching. This is done using a class of pseudo-randomly generated citation digraphs whose elements have bounded bibliography size. An attempt is made to explain the results obtained using a combinatorial formula of general application to digraphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
