{"id":"https://openalex.org/W2055488252","doi":"https://doi.org/10.1007/bf02574695","title":"A sparse graph almost as good as the complete graph on points inK dimensions","display_name":"A sparse graph almost as good as the complete graph on points inK dimensions","publication_year":1991,"publication_date":"1991-09-01","ids":{"openalex":"https://openalex.org/W2055488252","doi":"https://doi.org/10.1007/bf02574695","mag":"2055488252"},"language":"en","primary_location":{"id":"doi:10.1007/bf02574695","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02574695","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02574695.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/BF02574695.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108215094","display_name":"Pravin M. Vaidya","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]},{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pravin M. Vaidya","raw_affiliation_strings":["AT&T Bell Laboratories, 07974, Murray Hill, NJ, USA","AT&T Bell Laboratories, Murray Hill, USA 07974#TAB#"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, 07974, Murray Hill, NJ, USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Bell Laboratories, Murray Hill, USA 07974#TAB#","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108215094"],"corresponding_institution_ids":["https://openalex.org/I1283103587","https://openalex.org/I72090969"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.7184,"has_fulltext":true,"cited_by_count":99,"citation_normalized_percentile":{"value":0.92497869,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"369","last_page":"381"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.8647000193595886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7845996618270874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5618605017662048},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5345017313957214},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5260339379310608},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4845389723777771},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4222200810909271},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37776774168014526},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.3531373143196106},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2678956985473633}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8647000193595886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7845996618270874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5618605017662048},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5345017313957214},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5260339379310608},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4845389723777771},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4222200810909271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37776774168014526},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3531373143196106},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2678956985473633}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02574695","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02574695","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02574695.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/bf02574695","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf02574695","pdf_url":"https://link.springer.com/content/pdf/10.1007/BF02574695.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2055488252.pdf","grobid_xml":"https://content.openalex.org/works/W2055488252.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1514415888","https://openalex.org/W1976125024","https://openalex.org/W1993216012","https://openalex.org/W2005314985","https://openalex.org/W2008196645","https://openalex.org/W2031671531","https://openalex.org/W2031874971","https://openalex.org/W2036114412","https://openalex.org/W2089278402","https://openalex.org/W2161008043","https://openalex.org/W2911302472","https://openalex.org/W3133279294"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W4388031360","https://openalex.org/W94062305","https://openalex.org/W1974933866","https://openalex.org/W2963498914","https://openalex.org/W1778198164","https://openalex.org/W2749040238"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}