{"id":"https://openalex.org/W2062584330","doi":"https://doi.org/10.1142/s0129054199000125","title":"PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT","display_name":"PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT","publication_year":1999,"publication_date":"1999-06-01","ids":{"openalex":"https://openalex.org/W2062584330","doi":"https://doi.org/10.1142/s0129054199000125","mag":"2062584330"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054199000125","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054199000125","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5022152674","display_name":"Michel Habib","orcid":"https://orcid.org/0000-0002-8564-2314"},"institutions":[{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"MICHEL HABIB","raw_affiliation_strings":["LIRMM, UMR CNRS-Universit\u00e9 Montpellier II, 161 rue Ada, 34392 Montpellier cedex 5, France"],"affiliations":[{"raw_affiliation_string":"LIRMM, UMR CNRS-Universit\u00e9 Montpellier II, 161 rue Ada, 34392 Montpellier cedex 5, France","institution_ids":["https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028652077","display_name":"Christophe Paul","orcid":"https://orcid.org/0000-0001-6519-975X"},"institutions":[{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"CHRISTOPHE PAUL","raw_affiliation_strings":["LaBRI, Universit\u00e9 Bordeaux I, 351, cours de la Lib\u00e9ration, 33405, Talence cedex, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 Bordeaux I, 351, cours de la Lib\u00e9ration, 33405, Talence cedex, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082075747","display_name":"Laurent Viennot","orcid":"https://orcid.org/0000-0003-3657-6979"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"LAURENT VIENNOT","raw_affiliation_strings":["INRIA, project Hypercom, Domaine de Voluceau-Rocquencourt, BP 105, 78153, Le Chesnay Cedex, France"],"affiliations":[{"raw_affiliation_string":"INRIA, project Hypercom, Domaine de Voluceau-Rocquencourt, BP 105, 78153, Le Chesnay Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022152674"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I19894307","https://openalex.org/I4210101743"],"apc_list":null,"apc_paid":null,"fwci":0.9768,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.76261856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"10","issue":"02","first_page":"147","last_page":"170"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6622734069824219},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6018949747085571},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5954408645629883},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.581699013710022},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5194036960601807},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5019829273223877},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4921835958957672},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4653022885322571},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4481988847255707},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4386637806892395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2999718189239502},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2923598885536194},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13012725114822388},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08994579315185547},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.0820980966091156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6622734069824219},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6018949747085571},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5954408645629883},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.581699013710022},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5194036960601807},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5019829273223877},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4921835958957672},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4653022885322571},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4481988847255707},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4386637806892395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2999718189239502},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2923598885536194},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13012725114822388},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08994579315185547},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0820980966091156},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054199000125","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054199000125","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.9602","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.9602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lirmm.fr/~paul/Biblio/Postscript/ijfcs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.7354","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.7354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://menetou.inria.fr/~viennot/pages-bi/../postscripts/ijfcs00.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1986022261","https://openalex.org/W1998509117","https://openalex.org/W2015906942","https://openalex.org/W2024491681","https://openalex.org/W2057556050","https://openalex.org/W2063906290","https://openalex.org/W2068361557","https://openalex.org/W2076081865","https://openalex.org/W2086119402","https://openalex.org/W2143327390","https://openalex.org/W2325654786","https://openalex.org/W4235295823"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W797244100","https://openalex.org/W4298155039","https://openalex.org/W2801186172","https://openalex.org/W2367560286","https://openalex.org/W2181812531","https://openalex.org/W961204790"],"abstract_inverted_index":{"Partition":[0],"refinement":[1],"techniques":[2],"lead":[3],"to":[4,85],"simple":[5,62],"and":[6,17,36,63,69,94],"efficient":[7],"algorithms":[8,20,65,77],"for":[9,19,30,66,70],"various":[10],"applications:":[11],"automaton":[12],"minimization,":[13],"string":[14],"sorting":[15],"\u2026":[16],"also":[18],"on":[21,96],"graphs.":[22],"A":[23],"generic":[24,54,92],"algorithm":[25,55],"that":[26],"can":[27],"be":[28],"used":[29],"all":[31],"these":[32,76],"applications":[33],"is":[34,42],"presented":[35],"briefly":[37],"discussed.":[38],"Such":[39],"an":[40,45,88],"approach":[41],"interesting":[43],"in":[44],"algorithmic":[46],"tool":[47],"kit":[48],"perspective.":[49],"New":[50],"instances":[51],"of":[52,90],"the":[53],"are":[56,73,78,82],"presented:":[57],"O(n+m":[58],"log":[59],"n)":[60],"very":[61,83],"practical":[64],"cographs":[67],"recognition":[68],"modular":[71],"decomposition":[72],"designed.":[74],"Although":[75],"not":[79],"linear,":[80],"they":[81],"easy":[84],"implement":[86],"(as":[87],"instanciation":[89],"a":[91],"procedure)":[93],"based":[95],"new":[97],"ideas.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}