{"id":"https://openalex.org/W1597191127","doi":"https://doi.org/10.1007/3-540-44669-9_55","title":"New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs","display_name":"New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1597191127","doi":"https://doi.org/10.1007/3-540-44669-9_55","mag":"1597191127"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44669-9_55","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44669-9_55","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/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"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":"Thomas Erlebach","raw_affiliation_strings":["Computer Engineering and Networks Laboratory (TIK), ETH Z\u00fcrich, CH-8092, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory (TIK), ETH Z\u00fcrich, CH-8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006321175","display_name":"Danica Vukadinovi\u0107 Greetham","orcid":"https://orcid.org/0000-0003-3822-7908"},"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":"Danica Vukadinovi\u0107","raw_affiliation_strings":["Computer Engineering and Networks Laboratory (TIK), ETH Z\u00fcrich, CH-8092, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory (TIK), ETH Z\u00fcrich, CH-8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8361,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.74096386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"483","last_page":"494"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6316378116607666},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6114424467086792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5431626439094543},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45901691913604736},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45890042185783386},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.45686811208724976},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4502342641353607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38494083285331726},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36691713333129883},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3300999402999878},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21562322974205017},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07441174983978271}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6316378116607666},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6114424467086792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5431626439094543},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45901691913604736},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45890042185783386},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.45686811208724976},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4502342641353607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38494083285331726},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36691713333129883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3300999402999878},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21562322974205017},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07441174983978271}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44669-9_55","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44669-9_55","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":16,"referenced_works":["https://openalex.org/W54798846","https://openalex.org/W1512052931","https://openalex.org/W1513400187","https://openalex.org/W1515357878","https://openalex.org/W1522026352","https://openalex.org/W1591562949","https://openalex.org/W1778142177","https://openalex.org/W1977545325","https://openalex.org/W2011039300","https://openalex.org/W2064117440","https://openalex.org/W2079300367","https://openalex.org/W2100440346","https://openalex.org/W2138081211","https://openalex.org/W2330003519","https://openalex.org/W4285719527","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W2151412766","https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W1539367839","https://openalex.org/W2963756941","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993","https://openalex.org/W1759713541"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}