{"id":"https://openalex.org/W1567841639","doi":"https://doi.org/10.1007/11758471_10","title":"Network Discovery and Verification with Distance Queries","display_name":"Network Discovery and Verification with Distance Queries","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1567841639","doi":"https://doi.org/10.1007/11758471_10","mag":"1567841639"},"language":"en","primary_location":{"id":"doi:10.1007/11758471_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11758471_10","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/593cb5db-9bb8-4f6e-82f5-ec9363faed37","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Department of Computer Science, University of Leicester,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester,","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003829918","display_name":"Alexander Hall","orcid":"https://orcid.org/0000-0002-5866-2221"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"id":"https://openalex.org/I4210112966","display_name":"Instituto de F\u00edsica Te\u00f3rica","ror":"https://ror.org/022r8mj40","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210112966","https://openalex.org/I63634437"]}],"countries":["CH","ES"],"is_corresponding":false,"raw_author_name":"Alexander Hall","raw_affiliation_strings":["Institute for Theoretical Computer Science, ETH Z\u00fcrich,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, ETH Z\u00fcrich,","institution_ids":["https://openalex.org/I4210112966","https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103088991","display_name":"Michael M. Hoffmann","orcid":"https://orcid.org/0000-0001-5307-7106"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael Hoffmann","raw_affiliation_strings":["Department of Computer Science, University of Leicester,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester,","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038083135","display_name":"Mat\u00fa\u0161 Miha\u013e\u00e1k","orcid":"https://orcid.org/0000-0002-1898-607X"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mat\u00fa\u0161 Miha\u013e\u00e1k","raw_affiliation_strings":["Department of Computer Science, University of Leicester,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester,","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8388,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7224995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9980999827384949,"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/computer-science","display_name":"Computer science","score":0.6240570545196533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6028500199317932},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5841268301010132},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.5608272552490234},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5498809218406677},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5063797235488892},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4796762466430664},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4412979483604431},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42229312658309937},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3987438678741455},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3484950661659241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2752343416213989},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27384817600250244}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6240570545196533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6028500199317932},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5841268301010132},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.5608272552490234},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5498809218406677},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5063797235488892},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4796762466430664},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4412979483604431},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42229312658309937},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3987438678741455},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3484950661659241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2752343416213989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27384817600250244},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/11758471_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11758471_10","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"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/593cb5db-9bb8-4f6e-82f5-ec9363faed37","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/593cb5db-9bb8-4f6e-82f5-ec9363faed37","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Erlebach, T, Hall, A, Hoffmann, M & Mihal\u00e1k, M 2006, Network Discovery and Verification with Distance Queries. in Proceedings of the 6th International Conference on Algorithms and Complexity (CIAC). https://doi.org/10.1007/11758471_10","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.6965","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.6965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.le.ac.uk/people/te17/papers/CS-06-002.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.183.6211","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.6211","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.le.ac.uk/publications/techreports/2006/CS-06-002.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.5447","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.5447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.ethz.ch/personal/mhall/papers/DiscovEHHM05.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/593cb5db-9bb8-4f6e-82f5-ec9363faed37","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/593cb5db-9bb8-4f6e-82f5-ec9363faed37","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Erlebach, T, Hall, A, Hoffmann, M & Mihal\u00e1k, M 2006, Network Discovery and Verification with Distance Queries. in Proceedings of the 6th International Conference on Algorithms and Complexity (CIAC). https://doi.org/10.1007/11758471_10","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W119359934","https://openalex.org/W1542364998","https://openalex.org/W1567841639","https://openalex.org/W1973911938","https://openalex.org/W2011039300","https://openalex.org/W2026014023","https://openalex.org/W2087226760","https://openalex.org/W2106600328","https://openalex.org/W2108442028","https://openalex.org/W2120511087","https://openalex.org/W2131559148","https://openalex.org/W2140668275","https://openalex.org/W2147853228","https://openalex.org/W2151972741","https://openalex.org/W2156626857","https://openalex.org/W2160565743","https://openalex.org/W2165084894","https://openalex.org/W2165743744","https://openalex.org/W4249692870"],"related_works":["https://openalex.org/W1981660486","https://openalex.org/W2093226551","https://openalex.org/W2569244175","https://openalex.org/W4237102200","https://openalex.org/W3164081298","https://openalex.org/W4299302777","https://openalex.org/W2183177437","https://openalex.org/W2777812223","https://openalex.org/W2025735030","https://openalex.org/W2949850490"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}