{"id":"https://openalex.org/W3141269131","doi":"https://doi.org/10.1109/date.2012.6176507","title":"On the optimality of K longest path generation algorithm under memory constraints","display_name":"On the optimality of K longest path generation algorithm under memory constraints","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W3141269131","doi":"https://doi.org/10.1109/date.2012.6176507","mag":"3141269131"},"language":"en","primary_location":{"id":"doi:10.1109/date.2012.6176507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)","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/A5020010429","display_name":"Jie Jiang","orcid":"https://orcid.org/0000-0003-3985-8701"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jie Jiang","raw_affiliation_strings":["Department of Informatics and Mathematics, University of Passau, Passau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Mathematics, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000150539","display_name":"M. Sauer","orcid":"https://orcid.org/0000-0001-6009-4158"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Sauer","raw_affiliation_strings":["Department of Computer Science, Albert-Ludwigs-University, Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert-Ludwigs-University, Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109586660","display_name":"Alejandro Czutro","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Czutro","raw_affiliation_strings":["Department of Computer Science, Albert-Ludwigs-University, Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert-Ludwigs-University, Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038861833","display_name":"Bernd Becker","orcid":"https://orcid.org/0000-0003-4031-3258"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"B. Becker","raw_affiliation_strings":["Department of Computer Science, Albert-Ludwigs-University, Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert-Ludwigs-University, Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027416202","display_name":"Ilia Polian","orcid":"https://orcid.org/0000-0002-6563-2725"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"I. Polian","raw_affiliation_strings":["Department of Informatics and Mathematics, University of Passau, Passau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Mathematics, University of Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5020010429"],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":null,"apc_paid":null,"fwci":0.8919,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.76552668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"418","last_page":"423"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T14117","display_name":"Integrated Circuits and Semiconductor Failure Analysis","score":0.9995999932289124,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976000189781189,"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/path","display_name":"Path (computing)","score":0.7421736121177673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6982167363166809},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6617010831832886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.643700122833252},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5222110152244568},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5050418972969055},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4770038425922394},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.467169851064682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2915094494819641},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1823364496231079},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17229625582695007}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7421736121177673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6982167363166809},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6617010831832886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.643700122833252},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5222110152244568},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5050418972969055},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4770038425922394},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.467169851064682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2915094494819641},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1823364496231079},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17229625582695007},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2012.6176507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2012.6176507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W612784192","https://openalex.org/W1495288325","https://openalex.org/W1991507789","https://openalex.org/W1997924609","https://openalex.org/W2009778415","https://openalex.org/W2097410912","https://openalex.org/W2119411872","https://openalex.org/W2121480480","https://openalex.org/W2123051093","https://openalex.org/W2124196450","https://openalex.org/W2140004775","https://openalex.org/W2141425839","https://openalex.org/W2151628041","https://openalex.org/W2154695555","https://openalex.org/W2156640787","https://openalex.org/W2156749158","https://openalex.org/W2171106257","https://openalex.org/W3141795114","https://openalex.org/W4236674018","https://openalex.org/W4245943116","https://openalex.org/W6684236933"],"related_works":["https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W2129550502","https://openalex.org/W2092513144","https://openalex.org/W1759713541","https://openalex.org/W4308773192","https://openalex.org/W1660309994","https://openalex.org/W1995629993","https://openalex.org/W2776102956","https://openalex.org/W2141450494"],"abstract_inverted_index":{"Adequate":[0],"coverage":[1],"of":[2,16,46,87,90,115,123],"small-delay":[3],"defects":[4],"in":[5,151],"circuits":[6],"affected":[7],"by":[8,42,166],"statistical":[9],"process":[10],"variations":[11],"requires":[12],"identification":[13],"and":[14,66,112,137],"sensitization":[15],"multiple":[17],"paths":[18,75,93],"through":[19],"potential":[20],"defect":[21,96,140],"sites.":[22],"Existing":[23],"K":[24,72],"longest":[25,73,92],"path":[26,35],"generation":[27],"(KLPG)":[28],"algorithms":[29,62],"use":[30],"a":[31,129,159,173],"data":[32],"structure":[33],"called":[34],"store":[36],"to":[37,172],"prune":[38],"the":[39,44,50,58,61,71,82,85,91,95,106,110,121,124,144,168],"search":[40],"space":[41],"restricting":[43],"number":[45],"sub-paths":[47],"considered":[48],"at":[49],"same":[51],"time.":[52],"While":[53],"this":[54,156],"restriction":[55],"speeds":[56],"up":[57],"KLPG":[59,132,161],"process,":[60],"lose":[63],"their":[64],"optimality":[65,165],"do":[67],"not":[68],"guarantee":[69],"that":[70,134,163],"sensitizable":[74],"are":[76,179],"indeed":[77],"found.":[78],"We":[79,98,126,154],"investigate,":[80],"for":[81,142,181],"first":[83],"time,":[84],"effects":[86],"missing":[88],"some":[89],"on":[94,105],"coverage.":[97],"systematically":[99],"quantify":[100],"how":[101],"setting":[102,167],"different":[103],"limits":[104],"path-store":[107,145,169],"size":[108,146,170],"affects":[109],"numbers":[111],"relative":[113],"lengths":[114],"identified":[116],"paths,":[117],"as":[118,120],"well":[119],"run-times":[122],"algorithm.":[125],"also":[127],"introduce":[128],"new":[130],"optimal":[131],"algorithm":[133,157],"works":[135],"iteratively":[136],"pinpointedly":[138],"addresses":[139],"locations":[141],"which":[143],"limit":[147,171],"has":[148],"been":[149],"exceeded":[150],"previous":[152],"iterations.":[153],"compare":[155],"with":[158],"na\u00efve":[160],"approach":[162],"achieves":[164],"very":[174],"large":[175],"value.":[176],"Extensive":[177],"experiments":[178],"reported":[180],"45nm-technology":[182],"data.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}