{"id":"https://openalex.org/W2017712488","doi":"https://doi.org/10.1109/drcn.2007.4762275","title":"p-cycle network design: From fewest in number to smallest in size","display_name":"p-cycle network design: From fewest in number to smallest in size","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2017712488","doi":"https://doi.org/10.1109/drcn.2007.4762275","mag":"2017712488"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2007.4762275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2007.4762275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 6th International Workshop on Design and Reliable Communication Networks","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032758074","display_name":"Diane Prisca Onguetou","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Diane P. Onguetou","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Alberta, Edmonton, Canada","TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087988640","display_name":"W.D. Grover","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wayne D. Grover","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Alberta, Edmonton, Canada","TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"TR Laboratories (Telecommunications Research Laboratories), Edmonton, AB, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032758074"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":2.1074,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86869306,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10232","display_name":"Optical Network Technologies","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.6334842443466187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5129251480102539},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.47105738520622253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3832050561904907},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26530104875564575},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.189640074968338},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09590652585029602}],"concepts":[{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.6334842443466187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5129251480102539},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.47105738520622253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3832050561904907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26530104875564575},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.189640074968338},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09590652585029602}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/drcn.2007.4762275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2007.4762275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 6th International Workshop on Design and Reliable Communication Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1513478909","https://openalex.org/W1582433586","https://openalex.org/W1595203954","https://openalex.org/W2037936810","https://openalex.org/W2059897880","https://openalex.org/W2062037462","https://openalex.org/W2094838639","https://openalex.org/W2124305658","https://openalex.org/W2130052144","https://openalex.org/W2144918725","https://openalex.org/W2146049426","https://openalex.org/W2153764491","https://openalex.org/W2158376963","https://openalex.org/W2163354469","https://openalex.org/W6678667117","https://openalex.org/W6683911239"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"An":[0],"idea":[1],"seems":[2],"to":[3,52,62,114,124,146,180,206,259],"have":[4,121],"spread":[5],"that":[6,21,89,135,163],"p-cycle":[7,132,161,228,241],"networks":[8,162],"are":[9,35,156,172,216],"always":[10],"based":[11,26],"on":[12,27],"a":[13,28,81,97,129,177,181,188,222,247],"single":[14,98],"Hamiltonian":[15],"cycle.":[16],"The":[17],"correct":[18],"understanding":[19],"is":[20],"while":[22],"they":[23],"can":[24],"be":[25,76,94,102,115,191,260],"Hamiltonian,":[29],"network":[30,92,133,229],"designs":[31,134],"involving":[32],"multiple":[33],"p-cycles":[34,55,74,215],"far":[36],"more":[37,78],"capacity-efficient":[38],"in":[39,68,197,246],"general.":[40],"In":[41],"fact,":[42],"from":[43,104],"an":[44,90],"optical":[45,64],"networking":[46],"standpoint":[47],"one":[48,110],"would":[49],"probably":[50],"like":[51],"work":[53],"with":[54,250],"of":[56,73,131,151,168,176,185,209,225,240],"the":[57,71,87,126,139,142,148,157,165,173,207,212,226,237,251,257],"smallest":[58,143,213],"size":[59,144],"(circumference)":[60],"possible,":[61],"satisfy":[63],"reach":[65],"considerations,":[66],"and":[67],"this":[69],"case":[70],"number":[72,150,167,184,208,239],"might":[75],"even":[77],"numerous":[79],"than":[80],"pure":[82],"minimum":[83,252],"capacity":[84,174,254],"design.":[85],"However,":[86],"fact":[88],"entire":[91],"could":[93,101],"protected":[95],"by":[96],"cyclic":[99],"structure":[100,112],"attractive":[103],"another":[105],"viewpoint":[106],"simply":[107],"because":[108],"only":[109],"logical":[111,238],"has":[113],"managed.":[116],"Thus,":[117],"different":[118],"recent":[119],"orientations":[120],"brought":[122],"us":[123],"realize":[125],"need":[127],"for":[128,160,256],"study":[130,224],"vary":[136],"systematically":[137],"across":[138],"range":[140],"between":[141],"p-cycles,":[145],"using":[147,194],"fewest":[149,166],"p-cycles.":[152],"Questions":[153],"include:":[154],"What":[155,171,204],"design":[158,178,190,230,248,258],"models":[159],"use":[164],"distinct":[169],"structures?":[170,186],"implications":[175],"restricted":[179],"specific":[182],"maximum":[183],"Can":[187],"capacity-optimal":[189],"\u00bfnudged\u00bf":[192],"into":[193],"fewer":[195],"structures":[196,210,242],"total":[198],"without":[199],"requiring":[200],"any":[201],"extra":[202],"capacity?":[203],"happens":[205],"if":[211],"possible":[214],"insisted":[217],"upon?":[218],"Accordingly,":[219],"we":[220],"offer":[221],"systematic":[223],"optimal":[227],"problem":[231],"addressing":[232],"such":[233],"questions":[234],"about":[235],"how":[236],"present":[243],"or":[244],"allowed":[245],"interacts":[249],"spare":[253],"required":[255],"100%":[261],"restorable.":[262]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}