{"id":"https://openalex.org/W2054605652","doi":"https://doi.org/10.1137/100812653","title":"Sparse Balanced Partitions and the Complexity of Subgraph Problems","display_name":"Sparse Balanced Partitions and the Complexity of Subgraph Problems","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2054605652","doi":"https://doi.org/10.1137/100812653","mag":"2054605652"},"language":"en","primary_location":{"id":"doi:10.1137/100812653","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100812653","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Tel-Aviv  University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Budapest Univ. of Technology & Economics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapest Univ. of Technology & Economics","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6381,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.6959689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"2","first_page":"631","last_page":"644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9983999729156494,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9983000159263611,"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/combinatorics","display_name":"Combinatorics","score":0.808312177658081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7626699805259705},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6504683494567871},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6460904479026794},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5529763102531433},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5195398926734924},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.47474485635757446},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4717443883419037},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4506613314151764},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4413905739784241},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.441217303276062},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4301251471042633},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.42936137318611145},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4108036160469055},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18288537859916687},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08773654699325562}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.808312177658081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7626699805259705},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6504683494567871},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6460904479026794},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5529763102531433},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5195398926734924},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.47474485635757446},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4717443883419037},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4506613314151764},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4413905739784241},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.441217303276062},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4301251471042633},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.42936137318611145},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4108036160469055},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18288537859916687},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08773654699325562},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/100812653","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100812653","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.725.5253","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.5253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bme.hu/%7Edmarx/papers/alon-marx-sparse.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W99828349","https://openalex.org/W1537449969","https://openalex.org/W1973819999","https://openalex.org/W1987681136","https://openalex.org/W1995725694","https://openalex.org/W1997698259","https://openalex.org/W2060159282","https://openalex.org/W2131867452","https://openalex.org/W2144452581","https://openalex.org/W2150004999","https://openalex.org/W2296148711","https://openalex.org/W2986773320","https://openalex.org/W4246925169"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W3008959778","https://openalex.org/W2288163449","https://openalex.org/W2032950096","https://openalex.org/W4300575715","https://openalex.org/W176100319","https://openalex.org/W4381707488","https://openalex.org/W2282273380","https://openalex.org/W1594283629","https://openalex.org/W2153952206"],"abstract_inverted_index":{"We":[0,39],"consider":[1],"the":[2,6,26,63,74,77,95],"problem":[3,57],"of":[4,8,17,28,65,76,79,88],"partitioning":[5],"vertices":[7],"an":[9,34],"-vertex":[10],"graph":[11,67],"with":[12,48],"maximum":[13],"degree":[14],"into":[15],"classes":[16],"size":[18],"at":[19],"most":[20],"in":[21,73],"a":[22,46],"way":[23],"that":[24,41],"minimizes":[25],"number":[27],"pairs":[29],"for":[30],"which":[31,69],"there":[32,42],"is":[33,43,54,58],"edge":[35],"between":[36],"and":[37,51,81],".":[38],"show":[40],"always":[44],"such":[45],"partition":[47],"adjacent":[49],"pairs,":[50],"this":[52,89],"bound":[53],"tight.":[55],"This":[56],"related":[59],"to":[60,94],"questions":[61],"about":[62],"depth":[64],"certain":[66],"embeddings,":[68],"have":[70],"been":[71,92],"used":[72],"study":[75],"complexity":[78],"subgraph":[80],"constraint":[82],"satisfaction":[83],"problems.":[84],"(A":[85],"corrected":[86],"version":[87],"paper":[90],"has":[91],"appended":[93],"originally":[96],"posted":[97],"pdf.)":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}