{"id":"https://openalex.org/W986638553","doi":"https://doi.org/10.1007/978-3-319-03780-6_12","title":"Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm","display_name":"Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W986638553","doi":"https://doi.org/10.1007/978-3-319-03780-6_12","mag":"986638553"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-03780-6_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03780-6_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5088179088","display_name":"W\u0142odzimierz Bielecki","orcid":"https://orcid.org/0000-0002-7943-6207"},"institutions":[{"id":"https://openalex.org/I155313962","display_name":"West Pomeranian University of Technology","ror":"https://ror.org/0596m7f19","country_code":"PL","type":"education","lineage":["https://openalex.org/I155313962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"W\u0142odzimierz Bielecki","raw_affiliation_strings":["Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.\u017bo\u0142nierska 49, 71\u2013210, Szczecin, Poland","West Pomeranian University of Technology,#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.\u017bo\u0142nierska 49, 71\u2013210, Szczecin, Poland","institution_ids":["https://openalex.org/I155313962"]},{"raw_affiliation_string":"West Pomeranian University of Technology,#TAB#","institution_ids":["https://openalex.org/I155313962"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075199162","display_name":"K. Kraska","orcid":null},"institutions":[{"id":"https://openalex.org/I155313962","display_name":"West Pomeranian University of Technology","ror":"https://ror.org/0596m7f19","country_code":"PL","type":"education","lineage":["https://openalex.org/I155313962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Kraska","raw_affiliation_strings":["Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.\u017bo\u0142nierska 49, 71\u2013210, Szczecin, Poland","West Pomeranian University of Technology,#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.\u017bo\u0142nierska 49, 71\u2013210, Szczecin, Poland","institution_ids":["https://openalex.org/I155313962"]},{"raw_affiliation_string":"West Pomeranian University of Technology,#TAB#","institution_ids":["https://openalex.org/I155313962"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030718438","display_name":"Tomasz Klimek","orcid":null},"institutions":[{"id":"https://openalex.org/I155313962","display_name":"West Pomeranian University of Technology","ror":"https://ror.org/0596m7f19","country_code":"PL","type":"education","lineage":["https://openalex.org/I155313962"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz Klimek","raw_affiliation_strings":["Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.\u017bo\u0142nierska 49, 71\u2013210, Szczecin, Poland","West Pomeranian University of Technology,#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.\u017bo\u0142nierska 49, 71\u2013210, Szczecin, Poland","institution_ids":["https://openalex.org/I155313962"]},{"raw_affiliation_string":"West Pomeranian University of Technology,#TAB#","institution_ids":["https://openalex.org/I155313962"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088179088"],"corresponding_institution_ids":["https://openalex.org/I155313962"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4115,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.63310918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.9767416715621948},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7521663904190063},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.7225203514099121},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6601012945175171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6039010286331177},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5942355394363403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5664471983909607},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.45106959342956543},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.4496029019355774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3309522867202759},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3181433081626892},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.255950003862381},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07587465643882751},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.04932713508605957}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9767416715621948},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7521663904190063},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7225203514099121},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6601012945175171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6039010286331177},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5942355394363403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5664471983909607},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.45106959342956543},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4496029019355774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3309522867202759},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3181433081626892},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.255950003862381},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07587465643882751},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.04932713508605957},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-03780-6_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03780-6_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1556566737","https://openalex.org/W1581022180","https://openalex.org/W1597840949","https://openalex.org/W1802524876","https://openalex.org/W1963547452","https://openalex.org/W1965253335","https://openalex.org/W1969311876","https://openalex.org/W1992122785","https://openalex.org/W2015478888","https://openalex.org/W2029988392","https://openalex.org/W2060732469","https://openalex.org/W2207936736","https://openalex.org/W2781499036","https://openalex.org/W2911894214","https://openalex.org/W4213311856","https://openalex.org/W4238644074"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2362009423","https://openalex.org/W2371151875","https://openalex.org/W2383282217","https://openalex.org/W2136009070","https://openalex.org/W4230967508","https://openalex.org/W2012063573","https://openalex.org/W1499233953","https://openalex.org/W1994877243","https://openalex.org/W1996983051"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}