{"id":"https://openalex.org/W1982561218","doi":"https://doi.org/10.1142/s0129054103001625","title":"LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS","display_name":"LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P<sub>6</sub>-FREE GRAPHS","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W1982561218","doi":"https://doi.org/10.1142/s0129054103001625","mag":"1982561218"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103001625","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001625","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/A5073726725","display_name":"Vassilis Giakoumakis","orcid":"https://orcid.org/0000-0002-2194-2342"},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"V. GIAKOUMAKIS","raw_affiliation_strings":["La.R.I.A, Universit\u00e9 de Picardie Jules Verne, 5 rue du Moulin Neuf, 80000  Amiens, France"],"affiliations":[{"raw_affiliation_string":"La.R.I.A, Universit\u00e9 de Picardie Jules Verne, 5 rue du Moulin Neuf, 80000  Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084003710","display_name":"Jean-Marie Vanherpe","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108471","display_name":"Le Mans Universit\u00e9","ror":"https://ror.org/01mtcc283","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210108471"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J. M. VANHERPE","raw_affiliation_strings":["Structures Discr\u00e8tes et Algorithmes, Universit\u00e9 du Maine, avenue O. Messian, 72085 Le Mans, C\u00e9dex 9, France"],"affiliations":[{"raw_affiliation_string":"Structures Discr\u00e8tes et Algorithmes, Universit\u00e9 du Maine, avenue O. Messian, 72085 Le Mans, C\u00e9dex 9, France","institution_ids":["https://openalex.org/I4210108471"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073726725"],"corresponding_institution_ids":["https://openalex.org/I4647051"],"apc_list":null,"apc_paid":null,"fwci":1.7729,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.83996637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"01","first_page":"107","last_page":"136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9973000288009644,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8398830890655518},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.7714147567749023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7070468664169312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6787467002868652},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.5382828712463379},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.506048858165741},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.499408483505249},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4837648868560791},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4699908494949341},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4386245608329773},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41230854392051697},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.22190314531326294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2022416889667511},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13725438714027405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12387874722480774},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07241705060005188}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8398830890655518},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.7714147567749023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7070468664169312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6787467002868652},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.5382828712463379},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.506048858165741},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.499408483505249},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4837648868560791},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4699908494949341},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4386245608329773},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41230854392051697},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.22190314531326294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2022416889667511},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13725438714027405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12387874722480774},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07241705060005188},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054103001625","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103001625","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1605448391","https://openalex.org/W1987507610","https://openalex.org/W1994887153","https://openalex.org/W2015906942","https://openalex.org/W2042657610","https://openalex.org/W2064721098","https://openalex.org/W2079887842"],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2083238533","https://openalex.org/W4287117052","https://openalex.org/W2061237693","https://openalex.org/W2063494850","https://openalex.org/W2031276298","https://openalex.org/W2132199417","https://openalex.org/W1977862280","https://openalex.org/W3176308333","https://openalex.org/W4289672287"],"abstract_inverted_index":{"In":[0],"[7]":[1],"was":[2,12],"introduced":[3],"a":[4],"new":[5],"decomposition":[6],"scheme":[7],"for":[8,30,39,62,71],"bipartite":[9,49],"graphs":[10,17,35,50],"that":[11],"called":[13],"canonical":[14],"decomposition.":[15,23],"Weak-bisplit":[16],"are":[18],"totally":[19],"decomposable":[20],"following":[21],"this":[22,43],"We":[24,65],"give":[25],"here":[26],"linear":[27],"time":[28],"algorithms":[29,55],"the":[31,45,52,57],"recognition":[32],"of":[33,42],"weak-bisplit":[34,78],"as":[36,38],"well":[37],"two":[40],"subclasses":[41],"class,":[44],"P":[46],"6":[47],"-free":[48],"and":[51],"bi-cographs.":[53],"Our":[54],"extends":[56],"technics":[58],"developped":[59],"in":[60],"[2]":[61],"cographs's":[63],"recognition.":[64],"conclude":[66],"by":[67],"presenting":[68],"efficient":[69],"solutions":[70],"some":[72],"optimization":[73],"problems":[74],"when":[75],"dealing":[76],"with":[77],"graphs.":[79]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}