{"id":"https://openalex.org/W2779747908","doi":"https://doi.org/10.1007/978-3-319-73117-9_20","title":"Simple Paths and Cycles Avoiding Forbidden\u00a0Paths","display_name":"Simple Paths and Cycles Avoiding Forbidden\u00a0Paths","publication_year":2017,"publication_date":"2017-12-21","ids":{"openalex":"https://openalex.org/W2779747908","doi":"https://doi.org/10.1007/978-3-319-73117-9_20","mag":"2779747908"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-73117-9_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-73117-9_20","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/A5011651962","display_name":"Benjamin Mom\u00e8ge","orcid":null},"institutions":[{"id":"https://openalex.org/I4210138412","display_name":"Centre de recherche Inria Lille - Nord Europe","ror":"https://ror.org/04eej9726","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210138412"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Benjamin Mom\u00e8ge","raw_affiliation_strings":["Inria Lille - Nord Europe, Villeneuve-d\u2019Ascq, France","Inria Lille - Nord Europe, Villeneuve-d'Ascq, France"],"affiliations":[{"raw_affiliation_string":"Inria Lille - Nord Europe, Villeneuve-d\u2019Ascq, France","institution_ids":["https://openalex.org/I4210138412"]},{"raw_affiliation_string":"Inria Lille - Nord Europe, Villeneuve-d'Ascq, France","institution_ids":["https://openalex.org/I4210138412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011651962"],"corresponding_institution_ids":["https://openalex.org/I4210138412"],"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.2668438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"285","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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/T11567","display_name":"semigroups and automata theory","score":0.9965000152587891,"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.7683937549591064},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.7457518577575684},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5617806911468506},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5474496483802795},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5185307264328003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4760189652442932},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47386956214904785},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4544525444507599},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4407691955566406},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4372076690196991},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.43655073642730713},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4243306815624237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19640791416168213},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.19554758071899414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1848689317703247},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.17398032546043396}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7683937549591064},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7457518577575684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5617806911468506},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5474496483802795},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5185307264328003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4760189652442932},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47386956214904785},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4544525444507599},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4407691955566406},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4372076690196991},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.43655073642730713},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4243306815624237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19640791416168213},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.19554758071899414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1848689317703247},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.17398032546043396},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-73117-9_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-73117-9_20","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":20,"referenced_works":["https://openalex.org/W130304896","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1975286948","https://openalex.org/W1975587904","https://openalex.org/W1994173198","https://openalex.org/W2001868457","https://openalex.org/W2006429817","https://openalex.org/W2013396468","https://openalex.org/W2027442194","https://openalex.org/W2040572217","https://openalex.org/W2099964107","https://openalex.org/W2101752896","https://openalex.org/W2108350607","https://openalex.org/W2116059756","https://openalex.org/W2118275860","https://openalex.org/W3039948875","https://openalex.org/W3141776272","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W2768859505","https://openalex.org/W2036803675","https://openalex.org/W2256329187","https://openalex.org/W4387272283","https://openalex.org/W2127206007","https://openalex.org/W3207048296","https://openalex.org/W755678515","https://openalex.org/W2046852387","https://openalex.org/W4388585714"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}