{"id":"https://openalex.org/W2308641315","doi":"https://doi.org/10.1051/ro/2015024","title":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","display_name":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","publication_year":2015,"publication_date":"2015-06-26","ids":{"openalex":"https://openalex.org/W2308641315","doi":"https://doi.org/10.1051/ro/2015024","mag":"2308641315"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2015024","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2015024","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro/2015024.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106132668","display_name":"Alain Quilliot","orcid":"https://orcid.org/0000-0002-6879-5669"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alain Quilliot","raw_affiliation_strings":["Universit\u00e9 Blaise Pascal, LIMOS, UMR CNRS 6158, BP 10125 Campus des C\u00e9zeaux, 63173 Aubi\u00e8re, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Blaise Pascal, LIMOS, UMR CNRS 6158, BP 10125 Campus des C\u00e9zeaux, 63173 Aubi\u00e8re, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I198244214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032025171","display_name":"Djamal Reba\u00efne","orcid":"https://orcid.org/0009-0007-5091-8943"},"institutions":[{"id":"https://openalex.org/I104914703","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi","ror":"https://ror.org/00y3hzd62","country_code":"CA","type":"education","lineage":["https://openalex.org/I104914703","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Djamal Rebaine","raw_affiliation_strings":["Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, D\u00e9partement d\u2019informatique et math\u00e9matique, 555, Bld. de l\u2019Universit\u00e9, Saguenay, Qu\u00e9bec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi, D\u00e9partement d\u2019informatique et math\u00e9matique, 555, Bld. de l\u2019Universit\u00e9, Saguenay, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I104914703"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":0,"currency":"EUR","value_usd":0},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.13700925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"50","issue":"2","first_page":"315","last_page":"325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9952999949455261,"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/algorithm","display_name":"Algorithm","score":0.613754153251648},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5604039430618286},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5033244490623474},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47050541639328003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40558162331581116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3096773624420166}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.613754153251648},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5604039430618286},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5033244490623474},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47050541639328003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40558162331581116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3096773624420166}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2015024","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2015024","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2016__50_2_315_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2015024/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2015024.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2016__50_2_315_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro/2015024/","pdf_url":"https://www.numdam.org/item/10.1051/ro/2015024.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2308641315.pdf","grobid_xml":"https://content.openalex.org/works/W2308641315.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1502167149","https://openalex.org/W1972789308","https://openalex.org/W1985495277","https://openalex.org/W1986491739","https://openalex.org/W2011039300","https://openalex.org/W2037583329","https://openalex.org/W2040355785","https://openalex.org/W2064535593","https://openalex.org/W2079966248","https://openalex.org/W2090666691"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W1979843330","https://openalex.org/W2964072617","https://openalex.org/W2976797620","https://openalex.org/W2260035625","https://openalex.org/W303980170","https://openalex.org/W2351491280","https://openalex.org/W2386767533","https://openalex.org/W2371447506","https://openalex.org/W1892170976"],"abstract_inverted_index":{"We":[0],"present":[1],"in":[2],"this":[3],"paper":[4],"two":[5],"simple":[6],"linear":[7,14],"algorithms":[8],"that":[9],"solve":[10],"to":[11],"optimality":[12],"the":[13,23,27],"ordering":[15],"problem":[16],"for":[17],"unweighted":[18],"tree":[19],"based":[20],"graphs":[21],"viz.":[22],"oriented":[24,28],"trees":[25],"and":[26],"divide-and-conquer":[29],"graphs.":[30]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}