{"id":"https://openalex.org/W2140285470","doi":"https://doi.org/10.1137/070685920","title":"Finding Branch-Decompositions and Rank-Decompositions","display_name":"Finding Branch-Decompositions and Rank-Decompositions","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2140285470","doi":"https://doi.org/10.1137/070685920","mag":"2140285470"},"language":"en","primary_location":{"id":"doi:10.1137/070685920","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070685920","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5090886391","display_name":"Petr Hlin\u011bn\u00fd","orcid":"https://orcid.org/0000-0003-2125-1514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr Hlin\u011bn\u00fd","raw_affiliation_strings":["hlineny@fi.muni.cz#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"hlineny@fi.muni.cz#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082994085","display_name":"Sang\u2010il Oum","orcid":"https://orcid.org/0000-0002-6889-7286"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sang-il Oum","raw_affiliation_strings":["sangil@kaist.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"sangil@kaist.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.0098,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.99279294,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"38","issue":"3","first_page":"1012","last_page":"1032"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9975000023841858,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9020145535469055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7673510313034058},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6623237729072571},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5665148496627808},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5371807813644409},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5325638055801392},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.513955295085907},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4499998688697815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4166601300239563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1077210009098053}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9020145535469055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7673510313034058},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6623237729072571},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5665148496627808},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5371807813644409},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5325638055801392},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.513955295085907},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4499998688697815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4166601300239563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1077210009098053},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070685920","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070685920","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1980469100","https://openalex.org/W1993328543","https://openalex.org/W1993704152","https://openalex.org/W2015906942","https://openalex.org/W2019137761","https://openalex.org/W2035344492","https://openalex.org/W2035362312","https://openalex.org/W2047871605","https://openalex.org/W2053991811","https://openalex.org/W2058685100","https://openalex.org/W2063951771","https://openalex.org/W2070790034","https://openalex.org/W2079618965","https://openalex.org/W2126513401","https://openalex.org/W2165880875","https://openalex.org/W2170114629"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2073872397","https://openalex.org/W2005661925","https://openalex.org/W2057654888","https://openalex.org/W4313598605","https://openalex.org/W2155501824"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,16,34,100,103],"new":[3],"algorithm":[4,26,50,96],"that":[5,22,63],"can":[6],"output":[7],"the":[8,73,80],"rank-decomposition":[9,104],"of":[10,15,41,57,75,79,86,99,105],"width":[11,42,107],"at":[12,43],"most":[13,44],"k":[14,45,87],"graph":[17],"if":[18,46],"such":[19,47],"exists.":[20,48],"For":[21],"we":[23],"use":[24],"an":[25,29],"that,":[27],"for":[28,53,82,97],"input":[30],"matroid":[31],"represented":[32],"over":[33],"fixed":[35,90],"finite":[36,91],"field,":[37],"outputs":[38],"its":[39],"branch-decomposition":[40,101],"This":[49],"works":[51],"also":[52],"partitioned":[54],"matroids.":[55],"Both":[56],"these":[58],"algorithms":[59],"are":[60],"fixed-parameter":[61,124],"tractable,":[62],"is,":[64],"they":[65],"run":[66],"in":[67],"time":[68],"$O(n^3)$":[69],"where":[70],"n":[71],"is":[72,122],"number":[74],"vertices":[76],"/":[77],"elements":[78],"input,":[81],"each":[83],"constant":[84],"value":[85],"and":[88,111],"any":[89],"field.":[92],"The":[93],"previous":[94],"best":[95],"construction":[98],"or":[102],"optimal":[106],"due":[108],"to":[109],"Oum":[110],"Seymour":[112],"[J.":[113],"Combin.":[114],"Theory":[115],"Ser.":[116],"B,":[117],"97":[118],"(2007),":[119],"pp.":[120],"385\u2013393]":[121],"not":[123],"tractable.":[125]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":15}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}