{"id":"https://openalex.org/W1980424220","doi":"https://doi.org/10.1007/s00453-008-9177-z","title":"A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph","display_name":"A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph","publication_year":2008,"publication_date":"2008-03-14","ids":{"openalex":"https://openalex.org/W1980424220","doi":"https://doi.org/10.1007/s00453-008-9177-z","mag":"1980424220"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9177-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9177-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5021390142","display_name":"Vladimir Kolmogorov","orcid":"https://orcid.org/0000-0002-7625-8986"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Vladimir Kolmogorov","raw_affiliation_strings":["Adastral Park Campus, University College London, Adastral Park, Martlesham Heath, IP5 3RE, UK","University College London, Adastral Park Campus, Adastral Park, IP5 3RE, Martlesham Heath, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Adastral Park Campus, University College London, Adastral Park, Martlesham Heath, IP5 3RE, UK","institution_ids":["https://openalex.org/I45129253"]},{"raw_affiliation_string":"University College London, Adastral Park Campus, Adastral Park, IP5 3RE, Martlesham Heath, UK#TAB#","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021390142"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8279,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.74132237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"56","issue":"4","first_page":"394","last_page":"412"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6209426522254944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6073099970817566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5725330114364624},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5539028644561768},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5481938123703003},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5184828639030457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4952065050601959},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49194809794425964},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4607139527797699},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.43872037529945374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42951419949531555},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41545504331588745}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6209426522254944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6073099970817566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5725330114364624},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5539028644561768},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5481938123703003},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5184828639030457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4952065050601959},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49194809794425964},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4607139527797699},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.43872037529945374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42951419949531555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41545504331588745}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-008-9177-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9177-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:123730","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/123730/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   ALGORITHMICA , 56  (4)   394 - 412.   (2010)      ","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W340373535","https://openalex.org/W612917828","https://openalex.org/W1508340563","https://openalex.org/W1576820654","https://openalex.org/W1969468986","https://openalex.org/W1993304147","https://openalex.org/W2013469283","https://openalex.org/W2018804864","https://openalex.org/W2023911069","https://openalex.org/W2038643780","https://openalex.org/W2043574467","https://openalex.org/W2048285065","https://openalex.org/W2062931369","https://openalex.org/W2065320942","https://openalex.org/W2067936976","https://openalex.org/W2090359754","https://openalex.org/W2110898430","https://openalex.org/W2116713392","https://openalex.org/W2117135110","https://openalex.org/W2130055503","https://openalex.org/W2182926040","https://openalex.org/W2258857078","https://openalex.org/W4242336842","https://openalex.org/W4254836771"],"related_works":["https://openalex.org/W2121204510","https://openalex.org/W2095284441","https://openalex.org/W2141353198","https://openalex.org/W3141688457","https://openalex.org/W3155269421","https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2078695342","https://openalex.org/W2590727506","https://openalex.org/W3208371897"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}