{"id":"https://openalex.org/W2169242520","doi":null,"title":"Exploring the powers of stacks and queues via graph layouts","display_name":"Exploring the powers of stacks and queues via graph layouts","alternate_titles":[],"publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2169242520","mag":"2169242520"},"language":"en","primary_location":{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/38418","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10919/38418","pdf_url":null,"source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"parent_works":[],"lineage":["https://openalex.org/W2169242520"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5049585070","display_name":"Sriram Venkata Pemmarju","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Sriram Venkata Pemmarju","raw_affiliation_strings":["Virginia Polytechnic Institute and State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Polytechnic Institute and State University","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049585070"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9639000296592712,"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.9639000296592712,"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.027799999341368675,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0012000000569969416,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/queue-layouts","display_name":"queue layouts","score":0.9980000257492065},{"id":"https://openalex.org/keywords/queue-number","display_name":"queue number","score":0.996999979019165},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9570000171661377},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.6830000281333923},{"id":"https://openalex.org/keywords/partial-orders","display_name":"partially ordered sets","score":0.9079999923706055},{"id":"https://openalex.org/keywords/planar-graphs","display_name":"planar graphs","score":0.5379999876022339},{"id":"https://openalex.org/keywords/outerplanar-graphs","display_name":"outerplanar graphs","score":0.9089999794960022},{"id":"https://openalex.org/keywords/unicyclic-graphs","display_name":"unicyclic graphs","score":0.8069999814033508},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.5360000133514404},{"id":"https://openalex.org/keywords/np-hardness-of-approximation","display_name":"NP-hardness of approximation","score":0.36500000953674316},{"id":"https://openalex.org/keywords/numerical-linear-algebra","display_name":"numerical linear algebra","score":0.5910000205039978}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6419575810432434},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6343948841094971},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5003321170806885},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.49250730872154236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49133744835853577},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.4201253354549408},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41135910153388977},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.41134870052337646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38057348132133484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36774134635925293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3524686098098755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3406081199645996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13028985261917114},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/38418","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10919/38418","pdf_url":null,"source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:2169242520","doi":null,"is_oa":false,"landing_page_url":"https://vtechworks.lib.vt.edu/handle/10919/38418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1999897678","https://openalex.org/W4232763292","https://openalex.org/W7099290407","https://openalex.org/W1970144066","https://openalex.org/W115636771","https://openalex.org/W1810619383","https://openalex.org/W4407801813","https://openalex.org/W7084383919","https://openalex.org/W7170139083","https://openalex.org/W2377282542"],"abstract_inverted_index":{"In":[0,379],"this":[1,95,198,256],"dissertation":[2],"we":[3,381,514],"employ":[4],"stack":[5,36,107,152,206,326,404],"and":[6,18,22,108,132,134,148,153,165,207,224,232,261,275,291,303,327,349,363,376,390,405,432,442,511],"queue":[7,23,39,109,154,181,208,230,328,406,469],"layouts":[8,24,110,155,231,277,329,407,470],"of":[9,16,25,33,41,47,51,78,85,92,101,111,119,130,151,171,179,183,189,239,278,294,309,330,341,352,354,386,393,408,420,425,446,449,458,471,482,485,492,502],"graphs":[10,26,112,333,487,494],"to":[11,74,213,220,284,316,372],"explore":[12],"the":[13,52,76,79,82,98,117,146,163,166,237,289,292,299,307,310,347,350,384,391,418,440,444,456,480,483,490],"relative":[14],"power":[15],"stacks":[17,86,131],"queues.":[19,88],"Stack":[20],"layout":[21,40,182],"can":[27,44],"be":[28,45],"examined":[29],"from":[30],"several":[31,217],"points":[32,91],"view.":[34],"A":[35],"or":[37,60,70,87],"a":[38,42,55,62,72,128,169,177,180,184,187,202,240,248,295,421,460,500],"graph":[43,53,63,80,185,222,296,300],"thought":[46],"as":[48,61,71,156,158,186,201,357,429],"an":[49],"embedding":[50],"in":[54,106,116,145,159,319,423],"plane":[56],"satisfying":[57],"certain":[58,67,447],"constraints,":[59],"linearization":[64],"that":[65,142,255,383,455,479,499,519],"optimizes":[66],"cost":[68],"measures,":[69],"scheme":[73,242,257],"process":[75],"edges":[77],"using":[81,509],"fewest":[83],"number":[84],"All":[89],"three":[90,320],"view":[93,102],"permeate":[94],"research,":[96],"though":[97],"third":[99,466],"point":[100],"dominates.":[103],"Specific":[104],"problems":[105,218,340],"have":[113],"their":[114],"origin":[115],"areas":[118],"VLSI,":[120],"fault-tolerant":[121],"computing,":[122],"scheduling":[123,342],"parallel":[124,343],"processes,":[125],"sorting":[126],"with":[127,193],"network":[129],"queues,":[133],"matrix":[135,192,233,245],"computations.":[136],"We":[137,345,366,413,434,451,497],"first":[138,174,323],"present":[139,368,436],"two":[140],"tools":[141,313],"are":[143,314,397],"useful":[144],"combinatorial":[147],"algorithmic":[149],"analysis":[150,253],"well":[157],"determining":[160],"bounds":[161,287,416,438],"on":[162,247,288,306,417,439,443],"stacknumber":[164,290,348,441,481],"queuenumber":[167,293,351,419,445,491],"for":[168,204,216,243],"variety":[170],"graphs.":[172,279,365,473],"The":[173,227,267,322,400,465],"tool":[175,203,269,281],"is":[176,262,270,325,337,403,463,468,488,495],"formulation":[178,199],"covering":[188],"its":[190],"adjacent":[191],"staircases.":[194],"Not":[195],"only":[196],"does":[197],"serve":[200],"analyzing":[205],"layouts,":[209,513],"it":[210,475],"also":[211,235,435],"leads":[212],"efficient":[214],"algorithms":[215,371],"related":[219],"sequences,":[221],"theory,":[223],"computational":[225],"geometry.":[226],"connection":[228],"between":[229],"covers":[234],"forms":[236],"basis":[238],"new":[241],"performing":[244],"computations":[246],"data":[249],"driven":[250],"network.":[251],"Our":[252],"reveals":[254],"uses":[258],"less":[259],"hardware":[260],"faster":[263],"than":[264],"existing":[265],"schemes.":[266],"second":[268,401],"obtained":[271],"by":[272,297,339,453],"considering":[273],"separated":[274,510],"mingled":[276,512],"This":[280,335],"allows":[282],"us":[283],"obtain":[285,317],"lower":[286,437],"partitioning":[298],"into":[301],"subgraphs":[302],"simply":[304],"concentrating":[305],"interaction":[308],"subgraphs.":[311],"These":[312],"used":[315],"results":[318],"areas.":[321],"area":[324,336,402,467],"directed":[331],"acyclic":[332],"(dags).":[334],"motivated":[338],"processes.":[344],"establish":[346,414],"classes":[353,448],"dags":[355,375,389,396],"such":[356,428],"trees,":[358],"unicylic":[359],"graphs,":[360,362],"outerplanar":[361],"planar":[364,472,486,493,503],"then":[367],"linear":[369],"time":[370],"recognize":[373],"1-stack":[374],"leveled-planar":[377],"dags.":[378],"contrast,":[380],"show":[382],"problem":[385,392,457],"recognizing":[387,394,459],"9-stack":[388],"4-queue":[395,461],"both":[398],"NP-complete.":[399,464],"partially":[409],"ordered":[410],"sets":[411],"(posets).":[412],"upper":[415],"poset":[422,462],"terms":[424],"other":[426],"measures":[427],"length,":[430],"width,":[431],"jumpnumber.":[433],"posets.":[450],"conclude":[452],"showing":[454],"While":[474],"has":[476],"been":[477],"shown":[478],"family":[484,501],"4,":[489],"unknown.":[496],"conjecture":[498],"graphs\u2014the":[504],"stellated":[505],"triangles\u2014has":[506],"unbounded":[507],"queuenumber;":[508],"demonstrate":[515],"significant":[516],"progress":[517],"towards":[518],"result.":[520]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2169242520","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2016-06-24T00:00:00"}
