{"id":"https://openalex.org/W4232763292","doi":"https://doi.org/10.1137/s0097539795291550","title":"Stack and Queue Layouts of Directed Acyclic Graphs: Part II","display_name":"Stack and Queue Layouts of Directed Acyclic Graphs: Part II","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W4232763292","doi":"https://doi.org/10.1137/s0097539795291550"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795291550","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795291550","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/A5057291575","display_name":"Lenwood S. Heath","orcid":"https://orcid.org/0000-0003-1608-431X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lenwood S. Heath","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013414239","display_name":"Sriram V. Pemmaraju","orcid":"https://orcid.org/0000-0002-0834-3476"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sriram V. Pemmaraju","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1976,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.85366757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"28","issue":"5","first_page":"1588","last_page":"1626"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.998199999332428,"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.8561521768569946},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.7038105726242065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6780680418014526},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5998422503471375},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.5760110020637512},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5362865924835205},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5249935388565063},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4830661416053772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35180002450942993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33906102180480957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24246546626091003},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17127695679664612},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07361626625061035}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.8561521768569946},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.7038105726242065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6780680418014526},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5998422503471375},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.5760110020637512},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5362865924835205},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5249935388565063},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4830661416053772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35180002450942993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33906102180480957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24246546626091003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17127695679664612},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07361626625061035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539795291550","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795291550","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1987216097","https://openalex.org/W1998294201","https://openalex.org/W1999897678","https://openalex.org/W2024491681","https://openalex.org/W2047088053","https://openalex.org/W2047899424","https://openalex.org/W2078050303"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W2372211403","https://openalex.org/W3164774158","https://openalex.org/W4298154565"],"abstract_inverted_index":{"Stack":[0],"layouts":[1,4,37],"and":[2,18,35,116,119,131],"queue":[3,36,75],"of":[5,38,46,55,66,86,93,121,126,134],"undirected":[6,57],"graphs":[7,41],"have":[8],"been":[9],"used":[10],"to":[11,51],"model":[12],"problems":[13,24],"in":[14,19,25,70,79],"fault":[15],"tolerant":[16],"computing":[17],"parallel":[20,26],"process":[21,27],"scheduling.":[22],"However,":[23],"scheduling":[28],"are":[29],"more":[30],"accurately":[31],"modeled":[32],"by":[33],"stack":[34,44,53,99],"directed":[39],"acyclic":[40],"(dags).":[42],"A":[43,74],"layout":[45,54,76,100],"a":[47,52,87,128,136],"dag":[48,68,88,130],"is":[49,77,89],"similar":[50],"an":[56,80],"graph,":[58],"with":[59],"the":[60,64,67,90,124,132],"additional":[61],"requirement":[62],"that":[63],"nodes":[65],"be":[69],"some":[71],"topological":[72],"order.":[73],"defined":[78],"analogous":[81],"manner.":[82],"The":[83,139],"stacknumber":[84],"(queuenumber)":[85],"smallest":[91],"number":[92],"stacks":[94],"(queues)":[95],"required":[96],"for":[97,112,123],"its":[98],"(queue":[101],"layout).":[102],"This":[103],"paper":[104,141],"presents":[105,151],"algorithmic":[106],"results---in":[107],"particular,":[108],"linear":[109],"time":[110],"algorithms":[111],"recognizing":[113,127,135],"1-stack":[114],"dags":[115],"1-queue":[117],"dags,":[118],"proofs":[120],"NP-completeness":[122],"problem":[125,133],"4-queue":[129],"6-stack":[137],"dag.":[138],"companion":[140],"(Part":[142],"I":[143],"[SIAM":[144],"J.":[145],"Comput.,":[146],"28":[147],"(1999),":[148],"pp.":[149],"1510--1539.])":[150],"combinatorial":[152],"results.":[153]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}