{"id":"https://openalex.org/W2063042204","doi":"https://doi.org/10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a","title":"Divide-and-conquer algorithms for graph-layout problems","display_name":"Divide-and-conquer algorithms for graph-layout problems","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2063042204","doi":"https://doi.org/10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a","mag":"2063042204"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5023768419","display_name":"Ram Swaminathan","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ram Swaminathan","raw_affiliation_strings":["RUTCOR and DIMACS Center, Rutgers University, Piscataway, New Jersey 08855"],"affiliations":[{"raw_affiliation_string":"RUTCOR and DIMACS Center, Rutgers University, Piscataway, New Jersey 08855","institution_ids":["https://openalex.org/I2799411422","https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023768419"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I2799411422"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.16946789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"2","first_page":"69","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9767000079154968,"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/computer-science","display_name":"Computer science","score":0.5876059532165527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5380285382270813},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.5202727913856506},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.510251522064209},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4527457356452942},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4398537874221802},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.424991250038147},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.390672892332077},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38969916105270386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.346222847700119},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18095725774765015},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1150175929069519}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5876059532165527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5380285382270813},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.5202727913856506},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.510251522064209},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4527457356452942},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4398537874221802},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.424991250038147},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.390672892332077},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38969916105270386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.346222847700119},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18095725774765015},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1150175929069519}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199609)28:2<69::aid-net1>3.0.co;2-a","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2031276298","https://openalex.org/W2952233599","https://openalex.org/W1566820354","https://openalex.org/W577041502","https://openalex.org/W4299811717","https://openalex.org/W2093949146","https://openalex.org/W1892973443","https://openalex.org/W2256054477","https://openalex.org/W3130332934","https://openalex.org/W4288294436"],"abstract_inverted_index":{"Tutte":[0,86,106],"introduced":[1],"a":[2,24,61,82,92],"decomposition":[3,87,107],"of":[4,26,36,52,75,88],"2-connected":[5,89],"graphs":[6,68,90],"which":[7],"has":[8],"widely":[9],"been":[10],"used":[11],"in":[12,69,112],"solving":[13],"various":[14],"graph-theoretic":[15],"problems.":[16],"In":[17,38],"this":[18],"paper,":[19],"we":[20,40],"extend":[21],"it":[22],"to":[23],"class":[25],"graph-layout":[27],"problems,":[28],"namely,":[29],"determining":[30],"the":[31,100],"bandwidth,":[32],"cutwidth,":[33],"and":[34,55],"pagenumber":[35],"graphs.":[37,57],"particular,":[39],"present":[41,60],"linear-time":[42,63],"algorithms":[43,77,117],"for":[44,65],"testing":[45],"and,":[46],"if":[47],"so,":[48],"constructing":[49],"linear":[50],"layouts":[51],"2-edge-connected":[53],"bandwidth-2":[54],"cut-width-3":[56],"We":[58],"also":[59],"simple":[62],"algorithm":[64],"embedding":[66],"series-parallel":[67],"two":[70],"pages.":[71],"The":[72],"interesting":[73],"feature":[74],"these":[76],"is":[78],"that":[79],"they":[80,96],"use":[81],"divide-and-conquer":[83],"paradigm":[84],"with":[85],"as":[91],"common":[93],"framework;":[94],"thus,":[95],"are":[97],"different":[98],"from":[99],"previously":[101],"known":[102],"algorithms.":[103],"Moreover,":[104],"since":[105],"can":[108],"be":[109],"computed":[110],"efficiently":[111],"parallel,":[113],"all":[114],"three":[115],"proposed":[116],"parallelize":[118],"naturally.":[119],"\u00a9":[120],"1996":[121],"John":[122],"Wiley":[123],"&":[124],"Sons,":[125],"Inc.":[126]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}