{"id":"https://openalex.org/W1607651383","doi":"https://doi.org/10.1007/978-3-662-47672-7_63","title":"Near-Linear Query Complexity for Graph Inference","display_name":"Near-Linear Query Complexity for Graph Inference","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1607651383","doi":"https://doi.org/10.1007/978-3-662-47672-7_63","mag":"1607651383"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-47672-7_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47672-7_63","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103555404","display_name":"Sampath Kannan","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sampath Kannan","raw_affiliation_strings":["Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035864448","display_name":"Claire Mathieu","orcid":"https://orcid.org/0000-0002-0517-112X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Claire Mathieu","raw_affiliation_strings":["D\u00e9partement d\u2019Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France","D\u00e9partement d'Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France","institution_ids":["https://openalex.org/I4210161954","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France","institution_ids":["https://openalex.org/I4210161954","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112807203","display_name":"Hang Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hang Zhou","raw_affiliation_strings":["D\u00e9partement d\u2019Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France","D\u00e9partement d'Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France","institution_ids":["https://openalex.org/I4210161954","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique UMR CNRS 8548, \u00c9cole Normale Sup\u00e9rieure, Paris, France","institution_ids":["https://openalex.org/I4210161954","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3839,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79752431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"773","last_page":"784"},"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.9987000226974487,"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.9987000226974487,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9966999888420105,"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/combinatorics","display_name":"Combinatorics","score":0.7392606735229492},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.595281183719635},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.47259125113487244},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.47023341059684753},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.45958012342453003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45294755697250366},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.44551020860671997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43537983298301697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4239733815193176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40462830662727356},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2788599133491516},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.27507323026657104},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2250363528728485}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7392606735229492},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.595281183719635},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.47259125113487244},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.47023341059684753},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.45958012342453003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45294755697250366},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.44551020860671997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43537983298301697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4239733815193176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40462830662727356},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2788599133491516},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.27507323026657104},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2250363528728485},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-47672-7_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47672-7_63","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1480967050","https://openalex.org/W1567841639","https://openalex.org/W1973911938","https://openalex.org/W1989541071","https://openalex.org/W1990411021","https://openalex.org/W1991531041","https://openalex.org/W2017274979","https://openalex.org/W2028332892","https://openalex.org/W2040924621","https://openalex.org/W2057994027","https://openalex.org/W2096320713","https://openalex.org/W2098865491","https://openalex.org/W2131559148","https://openalex.org/W2140668275"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W94062305","https://openalex.org/W4287775348","https://openalex.org/W2237480599","https://openalex.org/W4388031360","https://openalex.org/W1974933866","https://openalex.org/W1601223370"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}