{"id":"https://openalex.org/W2123897269","doi":"https://doi.org/10.1142/s1793830912500243","title":"YAO GRAPHS SPAN THETA GRAPHS","display_name":"YAO GRAPHS SPAN THETA GRAPHS","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2123897269","doi":"https://doi.org/10.1142/s1793830912500243","mag":"2123897269"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500243","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500243","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5011309583","display_name":"Mirela Damian","orcid":"https://orcid.org/0000-0002-8255-2639"},"institutions":[{"id":"https://openalex.org/I7863295","display_name":"Villanova University","ror":"https://ror.org/02g7kd627","country_code":"US","type":"education","lineage":["https://openalex.org/I7863295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"MIRELA DAMIAN","raw_affiliation_strings":["Department of Computer Science, Villanova University, Villanova, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Villanova University, Villanova, USA","institution_ids":["https://openalex.org/I7863295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051810255","display_name":"Kristin Raudonis","orcid":null},"institutions":[{"id":"https://openalex.org/I7863295","display_name":"Villanova University","ror":"https://ror.org/02g7kd627","country_code":"US","type":"education","lineage":["https://openalex.org/I7863295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"KRISTIN RAUDONIS","raw_affiliation_strings":["Department of Computer Science, Villanova University, Villanova, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Villanova University, Villanova, USA","institution_ids":["https://openalex.org/I7863295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011309583"],"corresponding_institution_ids":["https://openalex.org/I7863295"],"apc_list":null,"apc_paid":null,"fwci":5.6451,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9563304,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"04","issue":"02","first_page":"1250024","last_page":"1250024"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965000152587891,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8245348930358887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7130065560340881},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5261865854263306},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4923204183578491},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4728049635887146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46001148223876953},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4287140369415283},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4250662922859192},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.41228818893432617},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3901340663433075},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1976844072341919},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11215606331825256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10450586676597595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0919947624206543}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8245348930358887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7130065560340881},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5261865854263306},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4923204183578491},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4728049635887146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46001148223876953},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4287140369415283},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4250662922859192},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.41228818893432617},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3901340663433075},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1976844072341919},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11215606331825256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10450586676597595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0919947624206543},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830912500243","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500243","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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":5,"referenced_works":["https://openalex.org/W1505970908","https://openalex.org/W1962925365","https://openalex.org/W2139391136","https://openalex.org/W3021208656","https://openalex.org/W4205300528"],"related_works":["https://openalex.org/W4294294347","https://openalex.org/W2145396827","https://openalex.org/W2279239548","https://openalex.org/W115379796","https://openalex.org/W63976795","https://openalex.org/W2404658402","https://openalex.org/W2610298398","https://openalex.org/W4281992692","https://openalex.org/W2105228010","https://openalex.org/W164473625"],"abstract_inverted_index":{"Yao":[0,46,59,115],"and":[1,11,31,47,68,71,81],"Theta":[2,48,72,104],"graphs":[3,49,60,73],"are":[4],"defined":[5],"for":[6],"a":[7,12,37,66,79,111],"given":[8],"point":[9,22,33,67,80],"set":[10],"fixed":[13],"integer":[14],"k":[15,26],">":[16],"0.":[17],"The":[18,43],"space":[19],"around":[20],"each":[21,32,41,100],"is":[23,34,50,57,110,121],"divided":[24],"into":[25],"cones":[27],"of":[28,85,91,102,133,142,148,157,163],"equal":[29],"angle,":[30],"connected":[35],"to":[36,99],"nearest":[38,55],"neighbor":[39,56,87],"in":[40,51,113],"cone.":[42,94],"difference":[44],"between":[45,65,78],"the":[52,54,62,75,82,89,92,103,114,126,131,145,160],"way":[53],"defined:":[58],"minimize":[61,74],"Euclidean":[63,76],"distance":[64,77],"its":[69,86],"neighbor,":[70],"orthogonal":[83],"projection":[84],"on":[88,144,159],"bisector":[90],"hosting":[93],"We":[95],"prove":[96,138],"that,":[97],"corresponding":[98],"edge":[101,127],"graph":[105,116],"\u0398":[106,149],"6":[107,118,150,165],",":[108,151],"there":[109],"path":[112],"Y":[117,164],"whose":[119],"length":[120],"at":[122],"most":[123],"8.82":[124],"times":[125],"length.":[128],"Combined":[129],"with":[130],"result":[132],"Bonichon":[134],"et":[135],"al.,":[136],"who":[137],"an":[139,154],"upper":[140,155],"bound":[141,156],"2":[143],"stretch":[146,161],"factor":[147,162],"we":[152],"obtain":[153],"17.64":[158],".":[166]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}