{"id":"https://openalex.org/W7097546077","doi":null,"title":"Complexity of Minimum Biclique Decomposition of Bipartite Graphs","display_name":"Complexity of Minimum Biclique Decomposition of Bipartite Graphs","publication_year":2007,"publication_date":"2007-11-22","ids":{"openalex":"https://openalex.org/W7097546077"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.9322","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.9322","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/~bellicha/www-team/papers/./amilhastre1.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5071532206","display_name":"J\u00e9r\u00f4me Amilhastre","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. Amilhastre","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5071532206"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50599154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9926999807357788,"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.9926999807357788,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007199999876320362,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.9359999895095825},{"id":"https://openalex.org/keywords/complete-bipartite-subgraphs","display_name":"complete bipartite subgraphs","score":0.8040000200271606},{"id":"https://openalex.org/keywords/edge-partitioning","display_name":"edge partition","score":0.6759999990463257},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9229999780654907},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.722000002861023},{"id":"https://openalex.org/keywords/c4-free-graphs","display_name":"C4-free graphs","score":0.8510000109672546},{"id":"https://openalex.org/keywords/decision-problems","display_name":"decision problems","score":0.5410000085830688}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8827000260353088},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.7736999988555908},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7630000114440918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7555000185966492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5508999824523926},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4659999907016754},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.4659000039100647},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.43140000104904175},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4122999906539917},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.3926999866962433},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.39259999990463257},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.34700000286102295},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33219999074935913},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.31290000677108765},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.2939000129699707},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2802000045776367},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.27160000801086426},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.26910001039505005},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2639000117778778},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.9322","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.9322","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/~bellicha/www-team/papers/./amilhastre1.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7036783844","https://openalex.org/W409500359","https://openalex.org/W7097244216","https://openalex.org/W2405987656","https://openalex.org/W2957671013","https://openalex.org/W2594278890","https://openalex.org/W2000079004","https://openalex.org/W7055470160","https://openalex.org/W2309980888","https://openalex.org/W2065163038"],"abstract_inverted_index":{"Many":[0],"problems":[1],"studied":[2],"in":[3],"graph":[4,7],"theory":[5],"are":[6],"decomposition":[8],"problems.":[9],"The":[10],"minimum":[11],"number":[12],"of":[13,22,28],"complete":[14],"bipartite":[15,24,53],"graphs":[16],"needed":[17],"to":[18],"partition":[19],"the":[20],"edges":[21],"a":[23,38],"graph.":[25],"is":[26,33,50],"one":[27],"these":[29],"problem":[30],"and":[31,45],"it":[32,49],"still":[34],"open.":[35],"We":[36],"propose":[37],"NP-completness":[39],"proof":[40],"for":[41],"its":[42],"decision":[43],"version":[44],"we":[46],"show":[47],"that":[48],"polynomial":[51],"on":[52],"C4-free":[54],"graphs.":[55]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-27T00:00:00"}