{"id":"https://openalex.org/W1958462902","doi":"https://doi.org/10.1007/11604686_12","title":"Network Discovery and Verification","display_name":"Network Discovery and Verification","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1958462902","doi":"https://doi.org/10.1007/11604686_12","mag":"1958462902"},"language":"en","primary_location":{"id":"doi:10.1007/11604686_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_12","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":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/9c464de4-7bbf-4265-9f0d-3027f443bae5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048988854","display_name":"Zuzana Beerliov\u00e1","orcid":null},"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"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Zuzana Beerliova","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich,","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012182296","display_name":"Felix Eberhard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Felix Eberhard","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich,","institution_ids":[]}]},{"author_position":"middle","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,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester,","institution_ids":[]}]},{"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"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Alexander Hall","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich,","institution_ids":[]}]},{"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,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester,","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Mat\u00fa\u0161 Miha\u013e\u00e1k","orcid":null},"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,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester,","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029020542","display_name":"L. Shankar Ram","orcid":null},"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"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"L. Shankar Ram","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich,","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5048988854"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.13278333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"12","first_page":"127","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9919999837875366,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9919999837875366,"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.983299970626831,"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.9829000234603882,"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/hypercube","display_name":"Hypercube","score":0.7363858222961426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6384058594703674},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.618784487247467},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5433711409568787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4842678904533386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4818069338798523},{"id":"https://openalex.org/keywords/hypercube-graph","display_name":"Hypercube graph","score":0.46895021200180054},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4453745186328888},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43431252241134644},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4207908809185028},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41518735885620117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38969531655311584},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2851479649543762},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1072455644607544}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7363858222961426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6384058594703674},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.618784487247467},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5433711409568787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4842678904533386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4818069338798523},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.46895021200180054},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4453745186328888},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43431252241134644},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4207908809185028},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41518735885620117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38969531655311584},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2851479649543762},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1072455644607544},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/11604686_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_12","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":"doi:10.1109/jsac.2006.884015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2006.884015","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Communications","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/9c464de4-7bbf-4265-9f0d-3027f443bae5","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/9c464de4-7bbf-4265-9f0d-3027f443bae5","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Beerliov\u00e1, Z, Eberhard, F, Erlebach, T, Hall, A, Hoffmann, M, Mihal\u00e1k, M & Ram, L S 2006, 'Network Discovery and Verification', IEEE Journal on Selected Areas in Communications (JSAC), vol. 24, no. 12, pp. 2168-2181. https://doi.org/10.1109/JSAC.2006.884015","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.9121","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9121","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/DiscovBEEHHMR05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.7774","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.7774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2005/59/pdf/05031.ErlebachThomas.ExtAbstract.59.pdf","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:59","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.17","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:lra.le.ac.uk:2381/1832","is_oa":false,"landing_page_url":"http://doi.org/10.1109/JSAC.2006.884015","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"doi:10.4230/dagsemproc.05031.17","is_oa":true,"landing_page_url":"https://doi.org/10.4230/dagsemproc.05031.17","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:1958462902","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/dagstuhl/P5031.html#BeerliovaEEHHMR05","pdf_url":null,"source":{"id":"https://openalex.org/S4306418148","display_name":"Dagstuhl Seminar Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Dagstuhl Seminar Proceedings","raw_type":null}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/9c464de4-7bbf-4265-9f0d-3027f443bae5","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/9c464de4-7bbf-4265-9f0d-3027f443bae5","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Beerliov\u00e1, Z, Eberhard, F, Erlebach, T, Hall, A, Hoffmann, M, Mihal\u00e1k, M & Ram, L S 2006, 'Network Discovery and Verification', IEEE Journal on Selected Areas in Communications (JSAC), vol. 24, no. 12, pp. 2168-2181. https://doi.org/10.1109/JSAC.2006.884015","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1551888529","https://openalex.org/W1971801736","https://openalex.org/W2008620264","https://openalex.org/W2017546343","https://openalex.org/W2023146810","https://openalex.org/W2026014023","https://openalex.org/W2085331602","https://openalex.org/W2087226760","https://openalex.org/W2105232761","https://openalex.org/W2106600328","https://openalex.org/W2112203058","https://openalex.org/W2120511087","https://openalex.org/W2140668275","https://openalex.org/W2147853228","https://openalex.org/W2151972741","https://openalex.org/W2154255883","https://openalex.org/W2156626857","https://openalex.org/W2160565743","https://openalex.org/W2165084894","https://openalex.org/W2165743744","https://openalex.org/W4312512934","https://openalex.org/W6604922555","https://openalex.org/W6631722374","https://openalex.org/W6734199500"],"related_works":["https://openalex.org/W2952214240","https://openalex.org/W3198675854","https://openalex.org/W1994558960","https://openalex.org/W2154191591","https://openalex.org/W3087345281","https://openalex.org/W2950984876","https://openalex.org/W2485187644","https://openalex.org/W2952044548","https://openalex.org/W3183688096","https://openalex.org/W1577731219","https://openalex.org/W2043848465","https://openalex.org/W3080345935","https://openalex.org/W2950562895","https://openalex.org/W2903327508","https://openalex.org/W2140591663","https://openalex.org/W3130029923","https://openalex.org/W2949337276","https://openalex.org/W2946564432","https://openalex.org/W2985298301","https://openalex.org/W2949552662"],"abstract_inverted_index":{"<para":[0],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[1],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[2],"Due":[3],"to":[4,15,52,57,71,76,98],"its":[5],"fast,":[6],"dynamic,":[7],"and":[8,39,69,119,136,149],"distributed":[9],"growth":[10],"process,":[11],"it":[12,121],"is":[13,56,88,93],"hard":[14],"obtain":[16,53],"an":[17,176],"accurate":[18],"map":[19],"of":[20,31,46,66,85,102,130,165],"the":[21,29,32,47,67,81,100,107,140,144,150,154,166],"Internet.":[22,48],"In":[23],"many":[24],"cases,":[25],"such":[26,54],"a":[27,35,41,63,95,115],"map\u2014representing":[28],"structure":[30],"Internet":[33],"as":[34,114],"graph":[36],"with":[37],"nodes":[38],"links\u2014is":[40],"prerequisite":[42],"when":[43],"investigating":[44],"properties":[45],"A":[49],"common":[50],"way":[51],"maps":[55],"make":[58],"certain":[59],"local":[60],"measurements":[61,87,103],"at":[62],"small":[64],"subset":[65],"nodes,":[68],"then":[70],"combine":[72],"these":[73,86],"in":[74,159,175],"order":[75],"\u201cdiscover\u201d":[77],"(an":[78],"approximation":[79,151],"of)":[80],"actual":[82],"graph.":[83,109],"Each":[84],"potentially":[89],"quite":[90],"costly.":[91],"It":[92],"thus":[94],"natural":[96],"objective":[97],"minimize":[99],"number":[101],"which":[104],"still":[105],"discover":[106],"whole":[108],"We":[110,132],"formalize":[111],"this":[112],"problem":[113,118],"combinatorial":[116],"optimization":[117],"consider":[120],"for":[122,163],"two":[123,167],"different":[124,128],"models":[125],"characterized":[126],"by":[127],"types":[129],"measurements.":[131],"give":[133],"several":[134],"upper":[135],"lower":[137],"bounds":[138],"on":[139],"competitive":[141],"ratio":[142,152],"(for":[143,153],"online":[145],"network":[146,156],"discovery":[147],"problem)":[148,158],"offline":[155],"verification":[157],"both":[160],"models.":[161],"Furthermore,":[162],"one":[164],"models,":[168],"we":[169],"compare":[170],"four":[171],"simple":[172],"greedy":[173],"strategies":[174],"experimental":[177],"analysis.":[178],"</para>":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2025-10-10T00:00:00"}