{"id":"https://openalex.org/W1885685411","doi":"https://doi.org/10.3390/a8040810","title":"Finding Supported Paths in Heterogeneous Networks","display_name":"Finding Supported Paths in Heterogeneous Networks","publication_year":2015,"publication_date":"2015-10-09","ids":{"openalex":"https://openalex.org/W1885685411","doi":"https://doi.org/10.3390/a8040810","mag":"1885685411"},"language":"en","primary_location":{"id":"doi:10.3390/a8040810","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8040810","pdf_url":"https://www.mdpi.com/1999-4893/8/4/810/pdf?version=1444384419","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/8/4/810/pdf?version=1444384419","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361747","display_name":"Guillaume Fertin","orcid":"https://orcid.org/0000-0002-8251-2012"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Guillaume Fertin","raw_affiliation_strings":["LINA, UMR CNRS 6241, Universit\u00e9 de Nantes, Nantes 44322, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LINA, UMR CNRS 6241, Universit\u00e9 de Nantes, Nantes 44322, France","institution_ids":["https://openalex.org/I97188460","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087168202","display_name":"Christian Komusiewicz","orcid":"https://orcid.org/0000-0003-0829-7032"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Komusiewicz","raw_affiliation_strings":["Institut f\u00fcr Softwaretechnik und Theoretische Informatik, Technische Universit\u00e4t Berlin, Berlin D-10587, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Softwaretechnik und Theoretische Informatik, Technische Universit\u00e4t Berlin, Berlin D-10587, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018527530","display_name":"Hafedh Mohamed-Babou","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hafedh Mohamed-Babou","raw_affiliation_strings":["LINA, UMR CNRS 6241, Universit\u00e9 de Nantes, Nantes 44322, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LINA, UMR CNRS 6241, Universit\u00e9 de Nantes, Nantes 44322, France","institution_ids":["https://openalex.org/I97188460","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031719973","display_name":"Irena Rusu","orcid":"https://orcid.org/0000-0002-0444-3496"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Irena Rusu","raw_affiliation_strings":["LINA, UMR CNRS 6241, Universit\u00e9 de Nantes, Nantes 44322, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LINA, UMR CNRS 6241, Universit\u00e9 de Nantes, Nantes 44322, France","institution_ids":["https://openalex.org/I97188460","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048361747"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I97188460"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1506,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.55766552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"4","first_page":"810","last_page":"831"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9864000082015991,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/biological-network","display_name":"Biological network","score":0.7266643047332764},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6979116201400757},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6409310698509216},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6407300233840942},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5829413533210754},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5157437920570374},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5025851726531982},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4787399172782898},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47635698318481445},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.47297775745391846},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4535466432571411},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4387032389640808},{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.41875702142715454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36193233728408813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3220056891441345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2654935121536255}],"concepts":[{"id":"https://openalex.org/C28225019","wikidata":"https://www.wikidata.org/wiki/Q4915005","display_name":"Biological network","level":2,"score":0.7266643047332764},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6979116201400757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6409310698509216},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6407300233840942},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5829413533210754},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5157437920570374},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5025851726531982},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4787399172782898},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47635698318481445},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.47297775745391846},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4535466432571411},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4387032389640808},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.41875702142715454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36193233728408813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3220056891441345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2654935121536255},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a8040810","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8040810","pdf_url":"https://www.mdpi.com/1999-4893/8/4/810/pdf?version=1444384419","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01214037v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01214037","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 2015, ⟨10.3390/a8040810⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:9c51d26d6dd34436bfa61d55b61aa5e7","is_oa":true,"landing_page_url":"https://doaj.org/article/9c51d26d6dd34436bfa61d55b61aa5e7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 8, Iss 4, Pp 810-831 (2015)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/8/4/810/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a8040810","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a8040810","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a8040810","pdf_url":"https://www.mdpi.com/1999-4893/8/4/810/pdf?version=1444384419","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7881940298","display_name":null,"funder_award_id":"55934856","funder_id":"https://openalex.org/F4320320875","funder_display_name":"Deutscher Akademischer Austauschdienst"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320327974","display_name":"Conseil R\u00e9gional des Pays de la Loire","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1885685411.pdf","grobid_xml":"https://content.openalex.org/works/W1885685411.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W842423234","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1800278804","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1985286473","https://openalex.org/W1988515336","https://openalex.org/W2011039300","https://openalex.org/W2021036768","https://openalex.org/W2046116538","https://openalex.org/W2051627428","https://openalex.org/W2078542889","https://openalex.org/W2102221598","https://openalex.org/W2103571314","https://openalex.org/W2109294083","https://openalex.org/W2111086098","https://openalex.org/W2111894911","https://openalex.org/W2121773288","https://openalex.org/W2121906195","https://openalex.org/W2124847289","https://openalex.org/W2131735363","https://openalex.org/W2132251545","https://openalex.org/W2136316164","https://openalex.org/W2163217661","https://openalex.org/W2167222948","https://openalex.org/W2240907403","https://openalex.org/W2569646339","https://openalex.org/W2913688336","https://openalex.org/W4229758624","https://openalex.org/W4292230561","https://openalex.org/W6638451949"],"related_works":["https://openalex.org/W15348386","https://openalex.org/W2478888221","https://openalex.org/W2095452756","https://openalex.org/W2521885831","https://openalex.org/W1979360205","https://openalex.org/W2494457055","https://openalex.org/W2049332363","https://openalex.org/W1995044685","https://openalex.org/W4254703335","https://openalex.org/W2101359860"],"abstract_inverted_index":{"Subnetwork":[0],"mining":[1,20],"is":[2,72,101,109],"an":[3,59],"essential":[4],"issue":[5],"in":[6,41,76,113,135,141],"the":[7,18,25,47,50,64,69,97,105,149,155],"analysis":[8],"of":[9,21,53,85,99,107,154],"biological,":[10],"social":[11],"and":[12,58,68,138,144,151,160,168,182],"communication":[13,145],"networks.":[14,146],"Recent":[15],"applications":[16,134,140],"require":[17],"simultaneous":[19],"several":[22],"networks":[23,137],"on":[24,63,95,180],"same":[26,65],"or":[27,103,123],"a":[28,54,73,82,120,127],"similar":[29],"vertex":[30,66,79],"set.":[31],"That":[32],"is,":[33],"one":[34,116],"searches":[35],"for":[36,119],"subnetworks":[37],"fulfilling":[38],"different":[39],"properties":[40],"each":[42],"input":[43,51],"network.":[44],"We":[45,147,171],"study":[46,148],"case":[48],"that":[49,114,177],"consists":[52],"directed":[55],"graph":[56,61],"D":[57,77],"undirected":[60],"G":[62],"set,":[67],"sought":[70],"pattern":[71],"path":[74,122],"P":[75,100,108],"whose":[78],"set":[80],"induces":[81],"connected":[83],"subgraph":[84],"G.":[86],"In":[87],"this":[88],"context,":[89],"three":[90],"concrete":[91],"problems":[92,131],"arise,":[93],"depending":[94],"whether":[96,104],"existence":[98],"questioned":[102],"length":[106],"to":[110],"be":[111],"optimized:":[112],"case,":[115],"can":[117],"search":[118],"longest":[121],"(maybe":[124],"less":[125],"intuitively)":[126],"shortest":[128],"one.":[129],"These":[130],"have":[132],"immediate":[133],"biological":[136,183],"predictable":[139],"social,":[142],"information":[143],"classic":[150],"parameterized":[152],"complexity":[153],"problem,":[156],"thus":[157],"identifying":[158],"polynomial":[159],"NP-complete":[161],"cases,":[162],"as":[163,165],"well":[164],"fixed-parameter":[166],"tractable":[167],"W[1]-hard":[169],"cases.":[170],"also":[172],"propose":[173],"two":[174],"enumeration":[175],"algorithms":[176],"we":[178],"evaluate":[179],"synthetic":[181],"data.":[184]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}