{"id":"https://openalex.org/W1603736639","doi":"https://doi.org/10.1007/3-540-44968-x_13","title":"Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs","display_name":"Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1603736639","doi":"https://doi.org/10.1007/3-540-44968-x_13","mag":"1603736639"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44968-x_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44968-x_13","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":"conference-paper","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/A5039839389","display_name":"Yaw-Ling Lin","orcid":"https://orcid.org/0000-0001-8151-684X"},"institutions":[{"id":"https://openalex.org/I177918364","display_name":"Providence University","ror":"https://ror.org/03fcpsq87","country_code":"TW","type":"education","lineage":["https://openalex.org/I177918364"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yaw-Ling Lin","raw_affiliation_strings":["Providence University, 200 Chung Chi Road, Sa-Lu, Taichung Shang, 433, Taiwan, R.O.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Providence University, 200 Chung Chi Road, Sa-Lu, Taichung Shang, 433, Taiwan, R.O.C","institution_ids":["https://openalex.org/I177918364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030877187","display_name":"Fang-Rong Hsu","orcid":"https://orcid.org/0000-0001-9791-317X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fang Rong Hsu","raw_affiliation_strings":["Department of Computer Science and Information Management, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Management, Taiwan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108455747","display_name":"Yin-Te Tsai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin-Te Tsai","raw_affiliation_strings":["Department of Accounting, Taiwan","Department of Computer Science and Information Management, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Accounting, Taiwan","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science and Information Management, Taiwan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09027431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"126","last_page":"136"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9951000213623047,"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.9872000217437744,"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/dominating-set","display_name":"Dominating set","score":0.7469800710678101},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7377820014953613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7246692180633545},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6571128368377686},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6080114245414734},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5925183296203613},{"id":"https://openalex.org/keywords/trapezoid-graph","display_name":"Trapezoid graph","score":0.5842841267585754},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5444125533103943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4603315591812134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43613603711128235},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4289216995239258},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41626426577568054},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.32817232608795166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32440072298049927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1437457799911499},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.13308212161064148}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7469800710678101},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7377820014953613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7246692180633545},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6571128368377686},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6080114245414734},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5925183296203613},{"id":"https://openalex.org/C10325715","wikidata":"https://www.wikidata.org/wiki/Q7835582","display_name":"Trapezoid graph","level":5,"score":0.5842841267585754},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5444125533103943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4603315591812134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43613603711128235},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4289216995239258},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41626426577568054},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.32817232608795166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32440072298049927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1437457799911499},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.13308212161064148},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44968-x_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44968-x_13","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1493071618","https://openalex.org/W1494942566","https://openalex.org/W1579049696","https://openalex.org/W1965327193","https://openalex.org/W1967572882","https://openalex.org/W1972965975","https://openalex.org/W2007514897","https://openalex.org/W2010733068","https://openalex.org/W2033410225","https://openalex.org/W2076261965","https://openalex.org/W2152506638","https://openalex.org/W6629413194"],"related_works":["https://openalex.org/W1602303252","https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W2388345276","https://openalex.org/W2155984879","https://openalex.org/W2548944478","https://openalex.org/W4300671851","https://openalex.org/W2391238671","https://openalex.org/W89315147","https://openalex.org/W4366983102"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}