{"id":"https://openalex.org/W1483988593","doi":"https://doi.org/10.1007/978-3-642-16958-8_37","title":"Subgraphs Generating Algorithm for Obtaining Set of Node-Disjoint Paths in Terrain-Based Mesh Graphs","display_name":"Subgraphs Generating Algorithm for Obtaining Set of Node-Disjoint Paths in Terrain-Based Mesh Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1483988593","doi":"https://doi.org/10.1007/978-3-642-16958-8_37","mag":"1483988593"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16958-8_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16958-8_37","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/A5007713818","display_name":"Zbigniew Tarapata","orcid":"https://orcid.org/0000-0001-8143-7869"},"institutions":[{"id":"https://openalex.org/I2800249161","display_name":"Military University of Technology in Warsaw","ror":"https://ror.org/05fct5h31","country_code":"PL","type":"education","lineage":["https://openalex.org/I2800249161"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Zbigniew Tarapata","raw_affiliation_strings":["Cybernetics Faculty, Military University of Technology, Gen. S. Kaliskiego Str. 2, 00-908, Warsaw, Poland","Military University of Technology, Cybernetics Faculty, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Cybernetics Faculty, Military University of Technology, Gen. S. Kaliskiego Str. 2, 00-908, Warsaw, Poland","institution_ids":["https://openalex.org/I2800249161"]},{"raw_affiliation_string":"Military University of Technology, Cybernetics Faculty, Warsaw, Poland","institution_ids":["https://openalex.org/I2800249161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025572572","display_name":"Stefan Wroclawski","orcid":null},"institutions":[{"id":"https://openalex.org/I2800249161","display_name":"Military University of Technology in Warsaw","ror":"https://ror.org/05fct5h31","country_code":"PL","type":"education","lineage":["https://openalex.org/I2800249161"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Stefan Wroclawski","raw_affiliation_strings":["Cybernetics Faculty, Military University of Technology, Gen. S. Kaliskiego Str. 2, 00-908, Warsaw, Poland","Military University of Technology, Cybernetics Faculty, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Cybernetics Faculty, Military University of Technology, Gen. S. Kaliskiego Str. 2, 00-908, Warsaw, Poland","institution_ids":["https://openalex.org/I2800249161"]},{"raw_affiliation_string":"Military University of Technology, Cybernetics Faculty, Warsaw, Poland","institution_ids":["https://openalex.org/I2800249161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007713818"],"corresponding_institution_ids":["https://openalex.org/I2800249161"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8928,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8105939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"398","last_page":"409"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9882000088691711,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7425690293312073},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6332297325134277},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5688179135322571},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5525047779083252},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4709770679473877},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4591507315635681},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43052539229393005},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4097350537776947},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3805880546569824},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3684161603450775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19248613715171814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1742001175880432}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7425690293312073},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6332297325134277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5688179135322571},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5525047779083252},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4709770679473877},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4591507315635681},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43052539229393005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4097350537776947},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3805880546569824},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3684161603450775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19248613715171814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1742001175880432},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-16958-8_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16958-8_37","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W27200453","https://openalex.org/W1540909241","https://openalex.org/W1545151502","https://openalex.org/W1580022438","https://openalex.org/W1580904767","https://openalex.org/W1604944183","https://openalex.org/W1965039153","https://openalex.org/W1967565181","https://openalex.org/W1997556033","https://openalex.org/W1998302192","https://openalex.org/W2003160050","https://openalex.org/W2019637647","https://openalex.org/W2057427520","https://openalex.org/W2112406764","https://openalex.org/W2130451730","https://openalex.org/W2131058166","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2165530198","https://openalex.org/W2728562282"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2939571613","https://openalex.org/W4221129498","https://openalex.org/W2761711678","https://openalex.org/W2170980056","https://openalex.org/W143403600","https://openalex.org/W2886722595"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
