{"id":"https://openalex.org/W1979383396","doi":"https://doi.org/10.1016/s0020-0190(97)00088-4","title":"A linear time algorithm for finding depth-first spanning trees on trapezoid graphs","display_name":"A linear time algorithm for finding depth-first spanning trees on trapezoid graphs","publication_year":1997,"publication_date":"1997-07-01","ids":{"openalex":"https://openalex.org/W1979383396","doi":"https://doi.org/10.1016/s0020-0190(97)00088-4","mag":"1979383396"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(97)00088-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00088-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5005947957","display_name":"Hon-Chan Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I118292597","display_name":"National Taipei University of Technology","ror":"https://ror.org/00cn92c09","country_code":"TW","type":"education","lineage":["https://openalex.org/I118292597"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hon-Chan Chen","raw_affiliation_strings":["Department of Information Management, National Taiwan Institute of Technology, Taipei, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National Taiwan Institute of Technology, Taipei, Taiwan, ROC","institution_ids":["https://openalex.org/I118292597"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115590756","display_name":"Yue-Li Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I118292597","display_name":"National Taipei University of Technology","ror":"https://ror.org/00cn92c09","country_code":"TW","type":"education","lineage":["https://openalex.org/I118292597"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yue-Li Wang","raw_affiliation_strings":["Department of Information Management, National Taiwan Institute of Technology, Taipei, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National Taiwan Institute of Technology, Taipei, Taiwan, ROC","institution_ids":["https://openalex.org/I118292597"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5115590756"],"corresponding_institution_ids":["https://openalex.org/I118292597"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.11424115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"63","issue":"1","first_page":"13","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.988099992275238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7616680264472961},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.658665657043457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6361970901489258},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5416202545166016},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.5364596843719482},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4742790162563324},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.46091726422309875},{"id":"https://openalex.org/keywords/trapezoid-graph","display_name":"Trapezoid graph","score":0.4440919756889343},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.416611909866333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41088002920150757},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38931071758270264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3641051650047302},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3358873724937439},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.241813063621521},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.13362595438957214},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12592273950576782}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7616680264472961},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.658665657043457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6361970901489258},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5416202545166016},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.5364596843719482},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4742790162563324},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.46091726422309875},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.4440919756889343},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.416611909866333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41088002920150757},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38931071758270264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3641051650047302},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3358873724937439},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.241813063621521},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.13362595438957214},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12592273950576782},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(97)00088-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00088-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1967528652","https://openalex.org/W1967572882","https://openalex.org/W1972965975","https://openalex.org/W2010733068","https://openalex.org/W2014239591","https://openalex.org/W2020283440","https://openalex.org/W2023670982","https://openalex.org/W2024792625","https://openalex.org/W2073273423","https://openalex.org/W2076261965","https://openalex.org/W2118382442","https://openalex.org/W2134969751","https://openalex.org/W2143474538","https://openalex.org/W2170132497","https://openalex.org/W2170762273","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W4231397933","https://openalex.org/W2374925474","https://openalex.org/W2911818503","https://openalex.org/W2779618893","https://openalex.org/W4380840098","https://openalex.org/W1966931974","https://openalex.org/W2138987445","https://openalex.org/W1541890612","https://openalex.org/W1570182137","https://openalex.org/W1738503018"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}