{"id":"https://openalex.org/W1683819337","doi":"https://doi.org/10.3233/fi-2014-1123","title":"The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems","display_name":"The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1683819337","doi":"https://doi.org/10.3233/fi-2014-1123","mag":"1683819337"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2014-1123","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2014-1123","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-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/A5031732925","display_name":"Pavel Surynek","orcid":"https://orcid.org/0000-0001-7200-0542"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Surynek","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic. pavel.surynek@mff.cuni.cz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic. pavel.surynek@mff.cuni.cz","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030317461","display_name":"Petra Surynkov\u00e1","orcid":"https://orcid.org/0000-0002-4370-3916"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petra Surynkov\u00e1","raw_affiliation_strings":["Department of Mathematics Education, Faculty of Mathematics and Physics, Charles University in Prague, Sokolovsk\u00e1 83, 186 75 Praha 8, Czech Republic. petra.surynkova@mff.cuni.cz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics Education, Faculty of Mathematics and Physics, Charles University in Prague, Sokolovsk\u00e1 83, 186 75 Praha 8, Czech Republic. petra.surynkova@mff.cuni.cz","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080226886","display_name":"Milo\u0161 Chrom\u00fd","orcid":"https://orcid.org/0000-0002-5357-1304"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Milo\u0161 Chrom\u00fd","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic. miloschromy@gmail.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic. miloschromy@gmail.com","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4944,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66979369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"135","issue":"3","first_page":"295","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/decomposition","display_name":"Decomposition","score":0.5914934873580933},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5521423816680908},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5163410902023315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49471184611320496},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4867570400238037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3825610280036926},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3762322664260864},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12375903129577637},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.05892130732536316}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5914934873580933},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5521423816680908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5163410902023315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49471184611320496},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4867570400238037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3825610280036926},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3762322664260864},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12375903129577637},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.05892130732536316},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2014-1123","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2014-1123","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W146776796","https://openalex.org/W1965680834","https://openalex.org/W1985591826","https://openalex.org/W1986164452","https://openalex.org/W2010255818","https://openalex.org/W2017927472","https://openalex.org/W2071346873","https://openalex.org/W2118382442","https://openalex.org/W2128865241","https://openalex.org/W2135939055","https://openalex.org/W2167451681","https://openalex.org/W2169528473","https://openalex.org/W2914296650"],"related_works":["https://openalex.org/W2380059383","https://openalex.org/W4224278052","https://openalex.org/W2063679720","https://openalex.org/W2031856784","https://openalex.org/W2018218513","https://openalex.org/W2185495545","https://openalex.org/W2075046161","https://openalex.org/W2385335131","https://openalex.org/W2067481825","https://openalex.org/W2064938438"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,36,39,47,63,70],"framework":[4],"for":[5,8,17,27,76],"analyzing":[6],"algorithms":[7],"inductive":[9],"processing":[10,58],"of":[11,38,54,65],"bi-connected":[12,23,41],"graphs.":[13],"The":[14,31,73,86],"BIBOX":[15,79],"algorithm":[16,32,80],"solving":[18],"cooperative":[19],"path-finding":[20],"problems":[21],"over":[22],"graphs":[24],"is":[25,51,60,83],"submitted":[26],"the":[28,49,57,66,78,92,99],"suggested":[29,93],"analysis.":[30],"proceeds":[33],"according":[34],"to":[35,62,98],"decomposition":[37,75],"given":[40],"graph":[42],"into":[43],"handles.":[44],"After":[45],"finishing":[46],"handle,":[48],"handle":[50,74],"ruled":[52],"out":[53],"consideration":[55],"and":[56],"task":[59,64],"reduced":[61],"same":[67],"type":[68],"on":[69],"smaller":[71],"graph.":[72],"which":[77],"performs":[81],"best":[82],"theoretically":[84],"identified.":[85],"conducted":[87],"experimental":[88],"evaluation":[89],"confirms":[90],"that":[91],"theoretical":[94],"analysis":[95],"well":[96],"corresponds":[97],"real":[100],"situation.":[101]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}