{"id":"https://openalex.org/W185778397","doi":null,"title":"Resolving the Network Reliability Problem with a Tree Decomposition of the Graph.","display_name":"Resolving the Network Reliability Problem with a Tree Decomposition of the Graph.","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W185778397","mag":"185778397"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.792","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.hds.utc.fr/~manouv/opodis.ps.gz","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5083407663","display_name":"Jean-Fran\u00e7ois Manouvrier","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jean-Fran\u00e7ois Manouvrier","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5079081181","display_name":"Corinne Lucet","orcid":"https://orcid.org/0000-0002-8634-7237","observed_orcids":["https://orcid.org/0000-0002-8634-7237"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Corinne Lucet","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8634-7237","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.6470000147819519,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.6470000147819519,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.20800000429153442,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11219999939203262,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-reliability","display_name":"network reliability","score":1.0},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"tree decomposition","score":0.9150000214576721},{"id":"https://openalex.org/keywords/treewidth","display_name":"treewidth","score":1.0},{"id":"https://openalex.org/keywords/all-terminal-reliability","display_name":"all-terminal reliability","score":0.7559999823570251},{"id":"https://openalex.org/keywords/dynamic-algorithms","display_name":"dynamic algorithms","score":0.7570000290870667},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.7910000085830688},{"id":"https://openalex.org/keywords/k-terminal-reliability","display_name":"K-terminal reliability","score":0.6830000281333923},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6520000100135803}],"concepts":[{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7709304094314575},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6432220339775085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6344070434570312},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5567870140075684},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5209368467330933},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4845639765262604},{"id":"https://openalex.org/C201729545","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability theory","level":3,"score":0.44252923130989075},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4293994605541229},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34690096974372864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27608782052993774},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14437073469161987},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13643652200698853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1310001015663147},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06257781386375427},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C163164238","wikidata":"https://www.wikidata.org/wiki/Q2737027","display_name":"Failure rate","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.792","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.hds.utc.fr/~manouv/opodis.ps.gz","raw_type":"text"},{"id":"mag:185778397","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/opodis/opodis97.html#ManouvrierL97","pdf_url":null,"source":{"id":"https://openalex.org/S4306419773","display_name":"International Conference on Principles of Distributed Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Principles of Distributed Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W10105891","https://openalex.org/W1587078595","https://openalex.org/W2013967419","https://openalex.org/W2029478301","https://openalex.org/W2033405938","https://openalex.org/W2034501206","https://openalex.org/W2035424484","https://openalex.org/W2052867211","https://openalex.org/W2059372025","https://openalex.org/W2071273467","https://openalex.org/W2074342195","https://openalex.org/W2085550081","https://openalex.org/W2107932240","https://openalex.org/W2143406303","https://openalex.org/W2151617868","https://openalex.org/W2986773320"],"related_works":["https://openalex.org/W1511312158","https://openalex.org/W7100143982","https://openalex.org/W2974843954","https://openalex.org/W1589159670","https://openalex.org/W1507115617","https://openalex.org/W2779000290","https://openalex.org/W2003298129","https://openalex.org/W2068018890","https://openalex.org/W2261274210","https://openalex.org/W2074342195"],"abstract_inverted_index":{"In":[0,119],"this":[1,120],"paper":[2,40],"is":[3,53,100],"given":[4],"a":[5,17,24,113,124,140,147],"method":[6,15,52,126],"to":[7,29,112,127],"resolve":[8,30,128],"the":[9,21,31,39,42,51,61,90,96,117,129,144],"network":[10,32,72,79,130],"reliability":[11,33,64,80,98,131],"problem.":[12],"This":[13],"dynamic":[14,74,125],"need":[16],"tree":[18,43,69,141],"decomposition":[19,44,142],"of":[20,58,116,136,143],"graph,":[22],"with":[23,55,65,86,146],"small":[25],"treewidth,":[26,71],"and":[27,45,49,84],"allows":[28],"problem":[34,99],"in":[35,89],"linear":[36],"time.":[37],"First,":[38],"explains":[41],"its":[46],"important":[47],"properties":[48],"then":[50],"explained":[54],"an":[56],"example":[57],"resolution":[59],"for":[60],"all":[62],"terminal":[63],"perfect":[66],"vertices.":[67],"Keywords:":[68],"decomposition,":[70],"reliability,":[73],"algorithms.":[75],"1.":[76],"Introduction":[77],"The":[78],"has":[81],"been":[82],"approached":[83],"resolved":[85,109],"different":[87],"methods":[88],"literature":[91],"[1][2][3].":[92],"For":[93],"general":[94],"networks,":[95],"K-terminal":[97],"NP-hard":[101],"[4].":[102],"Nevertheless,":[103],"some":[104],"particular":[105],"cases":[106],"can":[107],"be":[108],"easily":[110],"due":[111],"specific":[114],"topology":[115],"network.":[118],"article":[121],"we":[122],"present":[123],"problem,":[132],"that":[133],"generalizes":[134],"most":[135],"these":[137],"methods,":[138],"using":[139],"graph":[145],"bounded":[148],"treew...":[149]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}