{"id":"https://openalex.org/W4206994393","doi":"https://doi.org/10.1007/978-3-030-95018-7_8","title":"On Conflict-Free Spanning Tree: Algorithms and\u00a0Complexity","display_name":"On Conflict-Free Spanning Tree: Algorithms and\u00a0Complexity","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4206994393","doi":"https://doi.org/10.1007/978-3-030-95018-7_8"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-95018-7_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-95018-7_8","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/A5013916675","display_name":"Bruno Jos\u00e9 S. Barros","orcid":null},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Bruno Jos\u00e9 S. Barros","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016430153","display_name":"Luiz Satoru Ochi","orcid":"https://orcid.org/0000-0002-5007-4513"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luiz Satoru Ochi","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015504097","display_name":"Rian G. S. Pinheiro","orcid":"https://orcid.org/0000-0002-8759-6286"},"institutions":[{"id":"https://openalex.org/I79889768","display_name":"Universidade Federal de Alagoas","ror":"https://ror.org/00dna7t83","country_code":"BR","type":"education","lineage":["https://openalex.org/I79889768"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Rian Gabriel S. Pinheiro","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal de Alagoas, Macei\u00f3, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal de Alagoas, Macei\u00f3, Brazil","institution_ids":["https://openalex.org/I79889768"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077019769","display_name":"U\u00e9verton S. Souza","orcid":"https://orcid.org/0000-0002-5320-9209"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"U\u00e9verton S. Souza","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Federal Fluminense, Niter\u00f3i, Brazil","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6633,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64622537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8118863105773926},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.706399142742157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6469423770904541},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5631203651428223},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4616571366786957},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4462336003780365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4437795579433441},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43813925981521606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3941271901130676}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8118863105773926},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.706399142742157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6469423770904541},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5631203651428223},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4616571366786957},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4462336003780365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4437795579433441},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43813925981521606},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3941271901130676}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-95018-7_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-95018-7_8","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":13,"referenced_works":["https://openalex.org/W179052057","https://openalex.org/W1965680834","https://openalex.org/W1982713256","https://openalex.org/W2002284890","https://openalex.org/W2017927472","https://openalex.org/W2084332942","https://openalex.org/W2087216833","https://openalex.org/W2116638623","https://openalex.org/W2140043891","https://openalex.org/W2618703364","https://openalex.org/W2963779915","https://openalex.org/W3094363627","https://openalex.org/W3152779679"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2376814941","https://openalex.org/W2562218965","https://openalex.org/W2138987445","https://openalex.org/W3081212354","https://openalex.org/W2943635264","https://openalex.org/W3116169590","https://openalex.org/W2055747731","https://openalex.org/W2390742649","https://openalex.org/W2350799039"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}