{"id":"https://openalex.org/W4389986136","doi":"https://doi.org/10.1515/comp-2023-0103","title":"A combinatorial algorithm and its application in computing all minimum toll sets of graphs","display_name":"A combinatorial algorithm and its application in computing all minimum toll sets of graphs","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4389986136","doi":"https://doi.org/10.1515/comp-2023-0103"},"language":"en","primary_location":{"id":"doi:10.1515/comp-2023-0103","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1515/comp-2023-0103","pdf_url":"https://www.degruyter.com/document/doi/10.1515/comp-2023-0103/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.degruyter.com/document/doi/10.1515/comp-2023-0103/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058178293","display_name":"Samer Nofal","orcid":"https://orcid.org/0000-0002-0216-934X"},"institutions":[{"id":"https://openalex.org/I230091363","display_name":"German Jordanian University","ror":"https://ror.org/02jgpyd84","country_code":"JO","type":"education","lineage":["https://openalex.org/I230091363"]}],"countries":["JO"],"is_corresponding":true,"raw_author_name":"Samer Nofal","raw_affiliation_strings":["Department of Computer Science, German Jordanian University , Amman , Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, German Jordanian University , Amman , Jordan","institution_ids":["https://openalex.org/I230091363"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058178293"],"corresponding_institution_ids":["https://openalex.org/I230091363"],"apc_list":{"value":1000,"currency":"EUR","value_usd":1078},"apc_paid":{"value":1000,"currency":"EUR","value_usd":1078},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2490943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.991599977016449,"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.944599986076355,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9437000155448914,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6594135165214539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6238301396369934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5203344821929932},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5066602826118469},{"id":"https://openalex.org/keywords/toll","display_name":"Toll","score":0.44412773847579956},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42661598324775696},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39482834935188293}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6594135165214539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6238301396369934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5203344821929932},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5066602826118469},{"id":"https://openalex.org/C2778025104","wikidata":"https://www.wikidata.org/wiki/Q408004","display_name":"Toll","level":2,"score":0.44412773847579956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42661598324775696},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39482834935188293},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1515/comp-2023-0103","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1515/comp-2023-0103","pdf_url":"https://www.degruyter.com/document/doi/10.1515/comp-2023-0103/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:2230c15716de4075a1b489270c33ab87","is_oa":true,"landing_page_url":"https://doaj.org/article/2230c15716de4075a1b489270c33ab87","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":"Open Computer Science, Vol 13, Iss 1, Pp 161-175 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1515/comp-2023-0103","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1515/comp-2023-0103","pdf_url":"https://www.degruyter.com/document/doi/10.1515/comp-2023-0103/pdf","source":{"id":"https://openalex.org/S4210177004","display_name":"Open Computer Science","issn_l":"2299-1093","issn":["2299-1093"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4389986136.pdf","grobid_xml":"https://content.openalex.org/works/W4389986136.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W191877893","https://openalex.org/W1964913179","https://openalex.org/W1973562342","https://openalex.org/W2117475001","https://openalex.org/W2942955486","https://openalex.org/W2962749504","https://openalex.org/W2963426219","https://openalex.org/W2990240937","https://openalex.org/W3190596390","https://openalex.org/W3191123507","https://openalex.org/W3209070694","https://openalex.org/W4205984163","https://openalex.org/W4213328640","https://openalex.org/W4220780820","https://openalex.org/W4285585296"],"related_works":["https://openalex.org/W2757240192","https://openalex.org/W592613903","https://openalex.org/W2353712315","https://openalex.org/W588210059","https://openalex.org/W3022029543","https://openalex.org/W2359940423","https://openalex.org/W2378169260","https://openalex.org/W582981267","https://openalex.org/W2489749982","https://openalex.org/W3111310291"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"article":[2],"formalizes":[3],"an":[4,13],"algorithm":[5,21,57],"that":[6,108],"computes":[7],"the":[8,37,43,59,69,82,91,95],"minimum":[9],"toll":[10],"sets":[11],"in":[12,19,27,104,113],"undirected":[14],"graph.":[15],"A":[16],"core":[17],"process":[18],"our":[20,56],"is":[22,102],"to":[23,36],"check":[24],"vertex":[25],"subsets":[26,52,66,78,89],"order":[28,114],"of":[29,39,115],"size.":[30,116],"We":[31],"add":[32],"a":[33],"new":[34],"flavor":[35],"implementation":[38,101],"this":[40],"process;":[41],"when":[42],"<m:math":[44,60,70,83],"xmlns:m=\"http://www.w3.org/1998/Math/MathML\">":[45,61,71,84],"<m:mi>k</m:mi>":[46,62,72,85],"<m:mo>\u2212</m:mo>":[47,73],"<m:mn>1</m:mn>":[48,74],"</m:math>":[49,63,75,86],"k-1":[50,76],"-vertex":[51,65,77,88],"are":[53],"already":[54],"constructed,":[55],"produces":[58],"k":[64,87],"building":[67],"on":[68],"rather":[79],"than":[80],"reconstructing":[81],"from":[90],"ground":[92],"up":[93],"as":[94],"existing":[96],"algorithms":[97],"would":[98],"do.":[99],"Our":[100],"usable":[103],"combinatorial":[105],"minimization":[106],"problems":[107],"require":[109],"checking":[110],"variable-size":[111],"combinations":[112]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}