{"id":"https://openalex.org/W1485992990","doi":"https://doi.org/10.1007/3-540-36280-0_18","title":"Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs","display_name":"Calculating a Relational Program for Transitive Reductions of Strongly Connected Graphs","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1485992990","doi":"https://doi.org/10.1007/3-540-36280-0_18","mag":"1485992990"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-36280-0_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36280-0_18","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/A5042138172","display_name":"Rudolf Berghammer","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rudolf Berghammer","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, Olshausenstra\u03b2e 40, D-24098, Kiel","Christian-Albrechts Universit\u00e4t Kiel"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, Olshausenstra\u03b2e 40, D-24098, Kiel","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Christian-Albrechts Universit\u00e4t Kiel","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042627520","display_name":"Thorsten Hoffmann","orcid":"https://orcid.org/0000-0003-0939-271X"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thorsten Hoffmann","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, Olshausenstra\u03b2e 40, D-24098, Kiel","Christian-Albrechts Universit\u00e4t Kiel"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, Olshausenstra\u03b2e 40, D-24098, Kiel","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Christian-Albrechts Universit\u00e4t Kiel","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042138172"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10954872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9975000023841858,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965999722480774,"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/precomputation","display_name":"Precomputation","score":0.8183717727661133},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7448305487632751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6920597553253174},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5391085743904114},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5324405431747437},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.503971517086029},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.4463445842266083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4234764277935028},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3659953773021698},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3586195707321167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.28969305753707886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2739710807800293},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23587194085121155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23457974195480347},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.20104637742042542},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0854702889919281},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07521530985832214},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07315143942832947}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.8183717727661133},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7448305487632751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6920597553253174},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5391085743904114},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5324405431747437},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.503971517086029},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4463445842266083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4234764277935028},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3659953773021698},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3586195707321167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28969305753707886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2739710807800293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23587194085121155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23457974195480347},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.20104637742042542},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0854702889919281},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07521530985832214},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07315143942832947},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-36280-0_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36280-0_18","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":14,"referenced_works":["https://openalex.org/W171812378","https://openalex.org/W1588377709","https://openalex.org/W1655990431","https://openalex.org/W1970275691","https://openalex.org/W2010804773","https://openalex.org/W2035619490","https://openalex.org/W2091993453","https://openalex.org/W2103953153","https://openalex.org/W2147543351","https://openalex.org/W2481850285","https://openalex.org/W2752885492","https://openalex.org/W2952664587","https://openalex.org/W3139578191","https://openalex.org/W4250930808"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2362009423","https://openalex.org/W2136009070","https://openalex.org/W2371151875","https://openalex.org/W2383282217","https://openalex.org/W1994877243","https://openalex.org/W2012063573","https://openalex.org/W1996983051","https://openalex.org/W2349651113","https://openalex.org/W1499233953"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}