{"id":"https://openalex.org/W2634205767","doi":"https://doi.org/10.1007/978-3-540-28639-4_3","title":"Chordless Paths Through Three Vertices","display_name":"Chordless Paths Through Three Vertices","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2634205767","doi":"https://doi.org/10.1007/978-3-540-28639-4_3","mag":"2634205767"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-28639-4_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-28639-4_3","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/A5040989032","display_name":"Robert Haas","orcid":"https://orcid.org/0000-0001-7052-8263"},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Robert Haas","raw_affiliation_strings":["IBM Zurich Research Laboratory, R\u00fcschlikon"],"affiliations":[{"raw_affiliation_string":"IBM Zurich Research Laboratory, R\u00fcschlikon","institution_ids":["https://openalex.org/I4210126328"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103088991","display_name":"Michael M. Hoffmann","orcid":"https://orcid.org/0000-0001-5307-7106"},"institutions":[{"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"]},{"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","ES"],"is_corresponding":false,"raw_author_name":"Michael Hoffmann","raw_affiliation_strings":["Institute for Theoretical Computer Science, ETH Z\u00fcrich,"],"affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, ETH Z\u00fcrich,","institution_ids":["https://openalex.org/I4210112966","https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040989032"],"corresponding_institution_ids":["https://openalex.org/I4210126328"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3130105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9939000010490417,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9854000210762024,"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.7642444372177124},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6914879679679871},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.658048689365387},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.6430493593215942},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.632978081703186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.612472653388977},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6106743216514587},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5940380096435547},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5502837896347046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.432841420173645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34694698452949524},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.3095148801803589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21715408563613892},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.20802852511405945},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08944955468177795},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07561075687408447}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7642444372177124},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6914879679679871},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.658048689365387},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.6430493593215942},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.632978081703186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.612472653388977},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6106743216514587},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5940380096435547},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5502837896347046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.432841420173645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34694698452949524},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3095148801803589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21715408563613892},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.20802852511405945},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08944955468177795},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07561075687408447},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-28639-4_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-28639-4_3","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":27,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1497155250","https://openalex.org/W1523318401","https://openalex.org/W1538110468","https://openalex.org/W1972853793","https://openalex.org/W1982384331","https://openalex.org/W1991477862","https://openalex.org/W1991728994","https://openalex.org/W2002531683","https://openalex.org/W2005079828","https://openalex.org/W2011039300","https://openalex.org/W2021253994","https://openalex.org/W2028803564","https://openalex.org/W2054926952","https://openalex.org/W2057845264","https://openalex.org/W2060685279","https://openalex.org/W2061513598","https://openalex.org/W2074373676","https://openalex.org/W2086119402","https://openalex.org/W2110033737","https://openalex.org/W2395016968","https://openalex.org/W2569646339","https://openalex.org/W2951116413","https://openalex.org/W4210316907","https://openalex.org/W4213060883","https://openalex.org/W4254086873","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2070240448","https://openalex.org/W4377232111","https://openalex.org/W2634205767","https://openalex.org/W2144784192","https://openalex.org/W58573123","https://openalex.org/W2092747350","https://openalex.org/W4299525029","https://openalex.org/W2254699604","https://openalex.org/W2735325783","https://openalex.org/W3147054071"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}