{"id":"https://openalex.org/W2165648442","doi":"https://doi.org/10.1137/130907392","title":"Obtaining a Bipartite Graph by Contracting Few Edges","display_name":"Obtaining a Bipartite Graph by Contracting Few Edges","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2165648442","doi":"https://doi.org/10.1137/130907392","mag":"2165648442"},"language":"en","primary_location":{"id":"doi:10.1137/130907392","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130907392","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1102.5441","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022828497","display_name":"Pinar Heggernes","orcid":"https://orcid.org/0000-0001-9460-4355"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pinar Heggernes","raw_affiliation_strings":["Department of Informatics [Bergen]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics [Bergen]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017522059","display_name":"Pim van \u2019t Hof","orcid":"https://orcid.org/0000-0002-1778-7212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pim Van 'T Hof","raw_affiliation_strings":["Department of Informatics [Bergen]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics [Bergen]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics [Bergen]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics [Bergen]","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028652077","display_name":"Christophe Paul","orcid":"https://orcid.org/0000-0001-6519-975X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christophe Paul","raw_affiliation_strings":["Algorithmes, Graphes et Combinatoire"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmes, Graphes et Combinatoire","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7032,"has_fulltext":true,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96494344,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"27","issue":"4","first_page":"2143","last_page":"2156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.898703932762146},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7685391306877136},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.630967378616333},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.5383798480033875},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5334594249725342},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.5221360325813293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48695334792137146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4016857445240021},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37797310948371887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3725705146789551},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2379542887210846},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.17007356882095337}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.898703932762146},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7685391306877136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.630967378616333},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.5383798480033875},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5334594249725342},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.5221360325813293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48695334792137146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4016857445240021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37797310948371887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3725705146789551},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2379542887210846},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.17007356882095337},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/130907392","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130907392","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1102.5441","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1102.5441","pdf_url":"https://arxiv.org/pdf/1102.5441","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01178184v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01178184","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2013, 27 (4), pp.2143-2156. ⟨10.1137/130907392⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1102.5441","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1102.5441","pdf_url":"https://arxiv.org/pdf/1102.5441","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3727024547","display_name":"Algorithmes de graphes parametres et exacts","funder_award_id":"ANR-09-BLAN-0159","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2165648442.pdf","grobid_xml":"https://content.openalex.org/works/W2165648442.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W1981591809","https://openalex.org/W2005079828","https://openalex.org/W2022137727","https://openalex.org/W2028357390","https://openalex.org/W2046069847","https://openalex.org/W2051856222","https://openalex.org/W2062347470","https://openalex.org/W2065067474","https://openalex.org/W2086937160","https://openalex.org/W2089657800","https://openalex.org/W2105680721","https://openalex.org/W2105722028","https://openalex.org/W2121641644","https://openalex.org/W2157295389","https://openalex.org/W2165303918","https://openalex.org/W4234850175"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W2946972079","https://openalex.org/W3105424255","https://openalex.org/W2973019964","https://openalex.org/W4288345683"],"abstract_inverted_index":{"The":[0],"Bipartite":[1,42,56,80],"Contraction":[2,43,57],"problem":[3],"takes":[4],"as":[5,135],"input":[6],"an":[7,12],"$n$-vertex":[8],"graph":[9,27],"$G$":[10,29],"and":[11,15,58,90,102,120],"integer":[13],"$k$,":[14],"the":[16,59,66,106,113,116,121,140,143],"task":[17],"is":[18,44,112],"to":[19,69,75,79],"determine":[20],"whether":[21],"we":[22,86],"can":[23],"obtain":[24,83],"a":[25,31,52,136],"bipartite":[26],"from":[28],"by":[30,49],"sequence":[32],"of":[33,108,123,139,142],"at":[34],"most":[35],"$k$":[36],"edge":[37],"contractions.":[38],"We":[39],"show":[40],"that":[41,92],"fixed-parameter":[45],"tractable":[46],"when":[47],"parameterized":[48,96],"$k$.":[50],"Despite":[51],"strong":[53],"resemblance":[54],"between":[55],"classical":[60],"Odd":[61],"Cycle":[62],"Transversal":[63],"(OCT)":[64],"problem,":[65],"methods":[67],"developed":[68],"tackle":[70],"OCT":[71],"do":[72],"not":[73],"seem":[74],"be":[76],"directly":[77],"applicable":[78],"Contraction.":[81],"To":[82,105],"our":[84,109,131],"result,":[85],"combine":[87],"several":[88],"techniques":[89],"concepts":[91],"are":[93,126],"central":[94],"in":[95,128],"complexity:":[97],"iterative":[98],"compression,":[99],"irrelevant":[100,117,144],"vertices,":[101],"important":[103,124],"separators.":[104],"best":[107],"knowledge,":[110],"this":[111],"first":[114],"time":[115],"vertex":[118,145],"technique":[119],"concept":[122],"separators":[125],"applied":[127],"unison.":[129],"Furthermore,":[130],"algorithm":[132],"may":[133],"serve":[134],"comprehensible":[137],"example":[138],"usage":[141],"technique.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}