Metric Dimension
In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has been partially funded by the NSF IIS grant 1836914.
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2019-10 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Tillquist, Richard C Frongillo, Rafael M Lladser, Manuel E |
| description | In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has been partially funded by the NSF IIS grant 1836914. |
| doi_str_mv | 10.48550/arxiv.1910.04103 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1910_04103</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2303446225</sourcerecordid><originalsourceid>FETCH-LOGICAL-a525-db9e5d297f917f8aa16328bf8b8719675414f8f58c0d7ab2e0d01cbf1e4c43453</originalsourceid><addsrcrecordid>eNotzkFLAzEQBeAgCJZa8OpJwfPWyUxmkz1K1SpUvPQekt0EUuxuTVrRf-_aenrweDw-Ia4lzJVhhnuXv9PXXDZjAUoCnYkJEsnKKMQLMStlAwBYa2Smibh6C_uc2tvHtA19SUN_Kc6j-yhh9p9TsX5-Wi9eqtX78nXxsKocI1edbwJ32OjYSB2Nc7ImND4ab7Rsas1KqmgimxY67TwG6EC2PsqgWkWKaSpuTrdHrt3ltHX5x_6x7ZE9Lu5Oi10ePg-h7O1mOOR-NFkkIKVqRKZfh85CkA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2303446225</pqid></control><display><type>article</type><title>Metric Dimension</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Tillquist, Richard C ; Frongillo, Rafael M ; Lladser, Manuel E</creator><creatorcontrib>Tillquist, Richard C ; Frongillo, Rafael M ; Lladser, Manuel E</creatorcontrib><description>In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has been partially funded by the NSF IIS grant 1836914.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1910.04103</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Computer Science - Discrete Mathematics ; Mathematics - Combinatorics ; Mathematics - Optimization and Control</subject><ispartof>arXiv.org, 2019-10</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,785,886,27930</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1910.04103$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.4249/scholarpedia.53881$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Tillquist, Richard C</creatorcontrib><creatorcontrib>Frongillo, Rafael M</creatorcontrib><creatorcontrib>Lladser, Manuel E</creatorcontrib><title>Metric Dimension</title><title>arXiv.org</title><description>In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has been partially funded by the NSF IIS grant 1836914.</description><subject>Algorithms</subject><subject>Computer Science - Discrete Mathematics</subject><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Optimization and Control</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotzkFLAzEQBeAgCJZa8OpJwfPWyUxmkz1K1SpUvPQekt0EUuxuTVrRf-_aenrweDw-Ia4lzJVhhnuXv9PXXDZjAUoCnYkJEsnKKMQLMStlAwBYa2Smibh6C_uc2tvHtA19SUN_Kc6j-yhh9p9TsX5-Wi9eqtX78nXxsKocI1edbwJ32OjYSB2Nc7ImND4ab7Rsas1KqmgimxY67TwG6EC2PsqgWkWKaSpuTrdHrt3ltHX5x_6x7ZE9Lu5Oi10ePg-h7O1mOOR-NFkkIKVqRKZfh85CkA</recordid><startdate>20191009</startdate><enddate>20191009</enddate><creator>Tillquist, Richard C</creator><creator>Frongillo, Rafael M</creator><creator>Lladser, Manuel E</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20191009</creationdate><title>Metric Dimension</title><author>Tillquist, Richard C ; Frongillo, Rafael M ; Lladser, Manuel E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a525-db9e5d297f917f8aa16328bf8b8719675414f8f58c0d7ab2e0d01cbf1e4c43453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Computer Science - Discrete Mathematics</topic><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Tillquist, Richard C</creatorcontrib><creatorcontrib>Frongillo, Rafael M</creatorcontrib><creatorcontrib>Lladser, Manuel E</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tillquist, Richard C</au><au>Frongillo, Rafael M</au><au>Lladser, Manuel E</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Metric Dimension</atitle><jtitle>arXiv.org</jtitle><date>2019-10-09</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has been partially funded by the NSF IIS grant 1836914.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1910.04103</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2019-10 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1910_04103 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Computer Science - Discrete Mathematics Mathematics - Combinatorics Mathematics - Optimization and Control |
| title | Metric Dimension |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-12T21%3A57%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Metric%20Dimension&rft.jtitle=arXiv.org&rft.au=Tillquist,%20Richard%20C&rft.date=2019-10-09&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1910.04103&rft_dat=%3Cproquest_arxiv%3E2303446225%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2303446225&rft_id=info:pmid/&rfr_iscdi=true |