{"id":"https://openalex.org/W2032378868","doi":"https://doi.org/10.1137/060666615","title":"Long Local Searches for Maximal Bipartite Subgraphs","display_name":"Long Local Searches for Maximal Bipartite Subgraphs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2032378868","doi":"https://doi.org/10.1137/060666615","mag":"2032378868"},"language":"en","primary_location":{"id":"doi:10.1137/060666615","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060666615","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":["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/A5082592892","display_name":"Hemanshu Kaul","orcid":"https://orcid.org/0000-0002-6691-0176"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hemanshu Kaul","raw_affiliation_strings":["kaul@math.iit.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"kaul@math.iit.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Douglas B. West","raw_affiliation_strings":["west@math.uiuc.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"west@math.uiuc.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082592892"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.10164425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":"3","first_page":"1138","last_page":"1144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9957000017166138,"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/combinatorics","display_name":"Combinatorics","score":0.9101155996322632},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.807793140411377},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.7937018275260925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7752798199653625},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.58056640625},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5647647976875305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48013684153556824},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4645144045352936},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.43854260444641113},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42609864473342896},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4257318377494812},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4188898205757141},{"id":"https://openalex.org/keywords/multiple-edges","display_name":"Multiple edges","score":0.4182782471179962},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2565246820449829},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23976004123687744}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9101155996322632},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.807793140411377},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.7937018275260925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7752798199653625},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.58056640625},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5647647976875305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48013684153556824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4645144045352936},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.43854260444641113},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42609864473342896},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4257318377494812},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4188898205757141},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.4182782471179962},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2565246820449829},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23976004123687744},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/060666615","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060666615","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:CiteSeerX.psu:10.1.1.121.5757","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.5757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/pubs/flip.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.3434","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.3434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/pubs/flip.pdf","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/W155769578","https://openalex.org/W190864877","https://openalex.org/W1527517713","https://openalex.org/W1975442866","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2033447978","https://openalex.org/W2038562737","https://openalex.org/W2047970390","https://openalex.org/W2086793217","https://openalex.org/W4238018361","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2588224742","https://openalex.org/W4302436156","https://openalex.org/W2999374495","https://openalex.org/W3195563889","https://openalex.org/W2151370292","https://openalex.org/W4205497438","https://openalex.org/W3104642801","https://openalex.org/W1971599320","https://openalex.org/W2079573299","https://openalex.org/W2071364952"],"abstract_inverted_index":{"Given":[0],"a":[1,7,12,15,18,52,83,97,100],"partition":[2],"of":[3,6,17,48,59,85,102],"the":[4,25,28,44,60,63],"vertices":[5,37],"graph":[8,98],"into":[9],"two":[10],"sets,":[11],"flip":[13,66],"is":[14,81],"move":[16],"vertex":[19],"from":[20],"its":[21,39],"own":[22,40],"set":[23,41],"to":[24,36],"other,":[26],"under":[27],"condition":[29],"that":[30,79,90],"it":[31],"has":[32],"more":[33,56],"incident":[34],"edges":[35,61],"in":[38,43,62],"than":[42,57],"other.":[45],"Every":[46],"sequence":[47,84,101],"flips":[49,89],"eventually":[50],"produces":[51],"bipartite":[53],"subgraph":[54],"capturing":[55],"half":[58],"graph.":[64],"Each":[65],"gains":[67],"at":[68,86],"least":[69],"one":[70],"edge.":[71],"For":[72],"an":[73],"n-vertex":[74],"loopless":[75],"multigraph,":[76],"we":[77,95],"show":[78],"there":[80],"always":[82],"most":[87],"$n/2$":[88],"cannot":[91],"be":[92],"extended,":[93],"and":[94],"construct":[96],"having":[99],"$\\frac2{25}(n^2+n-31)$":[103],"flips.":[104]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}