{"id":"https://openalex.org/W4242746550","doi":"https://doi.org/10.2478/v10065-012-0038-7","title":"A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given","display_name":"A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W4242746550","doi":"https://doi.org/10.2478/v10065-012-0038-7"},"language":"en","primary_location":{"id":"doi:10.2478/v10065-012-0038-7","is_oa":false,"landing_page_url":"https://doi.org/10.2478/v10065-012-0038-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210184648","display_name":"Annales Universitatis Mariae Curie-Sklodowska sectio AI \u2013 Informatica","issn_l":"1732-1360","issn":["1732-1360","2083-3628"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales UMCS, Informatica","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/A5045878781","display_name":"Halina Bielak","orcid":null},"institutions":[{"id":"https://openalex.org/I174183983","display_name":"Maria Curie-Sk\u0142odowska University","ror":"https://ror.org/015h0qg34","country_code":"PL","type":"education","lineage":["https://openalex.org/I174183983"]},{"id":"https://openalex.org/I4210137370","display_name":"Institute of Mathematics","ror":"https://ror.org/04hrrh248","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210137370","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Halina Bielak","raw_affiliation_strings":["Institute of Mathematics, Maria Curie-Sklodowska University, pl. M. Curie-Sklodowskiej 5, 20-031 Lublin, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Maria Curie-Sklodowska University, pl. M. Curie-Sklodowskiej 5, 20-031 Lublin, Poland","institution_ids":["https://openalex.org/I174183983","https://openalex.org/I4210137370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103475799","display_name":"Micha\u0142 Pa\u0144czyk","orcid":null},"institutions":[{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I174183983","display_name":"Maria Curie-Sk\u0142odowska University","ror":"https://ror.org/015h0qg34","country_code":"PL","type":"education","lineage":["https://openalex.org/I174183983"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Micha\u0142 Pa\u0144czyk","raw_affiliation_strings":["Institute of Computer Science, Maria Curie-Sklodowska University, pl. M. Curie-Sklodowskiej 5, 20-031 Lublin, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Maria Curie-Sklodowska University, pl. M. Curie-Sklodowskiej 5, 20-031 Lublin, Poland","institution_ids":["https://openalex.org/I174183983","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103475799"],"corresponding_institution_ids":["https://openalex.org/I174183983","https://openalex.org/I4210087266"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64415252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9804999828338623,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.9778000116348267,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/spanning-tree","display_name":"Spanning tree","score":0.7689323425292969},{"id":"https://openalex.org/keywords/distributed-file-system","display_name":"Distributed File System","score":0.7289620041847229},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5445610880851746},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5093656778335571},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44133463501930237},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44097042083740234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4200972020626068}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7689323425292969},{"id":"https://openalex.org/C152043487","wikidata":"https://www.wikidata.org/wiki/Q1229600","display_name":"Distributed File System","level":2,"score":0.7289620041847229},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5445610880851746},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5093656778335571},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44133463501930237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44097042083740234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4200972020626068},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2478/v10065-012-0038-7","is_oa":false,"landing_page_url":"https://doi.org/10.2478/v10065-012-0038-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210184648","display_name":"Annales Universitatis Mariae Curie-Sklodowska sectio AI \u2013 Informatica","issn_l":"1732-1360","issn":["1732-1360","2083-3628"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annales UMCS, Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2073448902","https://openalex.org/W2084577435","https://openalex.org/W2095425626"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W2390742649","https://openalex.org/W3101281637","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We\u2019ve":[0,29],"built":[1],"this":[2],"digital":[3,15],"research":[4],"platform":[5,32],"to":[6,17],"provide":[7],"academics":[8],"everywhere":[9],"with":[10,36],"fast,":[11],"stable":[12],"and":[13,25,62],"secure":[14],"access":[16],"our":[18,57],"library":[19],"of":[20],"over":[21],"110,000":[22],"scholarly":[23],"books":[24],"800,000":[26],"journal":[27],"articles.":[28],"tested":[30],"the":[31],"in":[33],"close":[34],"cooperation":[35],"leading":[37],"academic":[38],"institutions.":[39],"If":[40],"you":[41,46],"have":[42],"any":[43],"questions":[44],"or":[45],"notice":[47],"something":[48],"doesn\u2019t":[49],"quite":[50],"work":[51],"as":[52],"it":[53],"should,":[54],"please":[55],"visit":[56],"<a":[58],"href=\"/publishing/faq?lang=en\"":[59],"class=\"text-primary\">Help/FAQ</a>":[60],"page":[61],"let":[63],"us":[64],"know.":[65]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}