{"id":"https://openalex.org/W1999897678","doi":"https://doi.org/10.1137/s0097539795280287","title":"Stack and Queue Layouts of Directed Acyclic Graphs: Part I","display_name":"Stack and Queue Layouts of Directed Acyclic Graphs: Part I","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1999897678","doi":"https://doi.org/10.1137/s0097539795280287","mag":"1999897678"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795280287","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795280287","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":"middle","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":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089382229","display_name":"Ann N. Trenk","orcid":"https://orcid.org/0000-0003-1145-3489"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ann N. Trenk","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.5969,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.86223491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"28","issue":"4","first_page":"1510","last_page":"1539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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.9998999834060669,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9983000159263611,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9165822267532349},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6693382263183594},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6201326847076416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6134520769119263},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5587399005889893},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48259222507476807},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4514518976211548},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.4298243224620819},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3581785559654236},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34037962555885315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32527855038642883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2985225319862366},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13252955675125122}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.9165822267532349},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6693382263183594},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6201326847076416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6134520769119263},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5587399005889893},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48259222507476807},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4514518976211548},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.4298243224620819},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3581785559654236},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34037962555885315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32527855038642883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2985225319862366},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13252955675125122},{"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":"doi:10.1137/s0097539795280287","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795280287","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.499","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.uiowa.edu/pub/sriram/graphs/dag1.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W115636771","https://openalex.org/W1488600671","https://openalex.org/W1538215615","https://openalex.org/W1567636794","https://openalex.org/W1964511178","https://openalex.org/W1967125711","https://openalex.org/W1970144066","https://openalex.org/W1987216097","https://openalex.org/W1998294201","https://openalex.org/W2024491681","https://openalex.org/W2047088053","https://openalex.org/W2047899424","https://openalex.org/W2068287758","https://openalex.org/W2078050303","https://openalex.org/W2119115989","https://openalex.org/W3161745826","https://openalex.org/W4232763292"],"related_works":["https://openalex.org/W2139269857","https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W4298154565"],"abstract_inverted_index":{"Stack":[0],"layouts":[1,4,36],"and":[2,17,34,112,121,136,142,155,168,191,194,206],"queue":[3,35,74],"of":[5,37,45,54,65,86,93,114,117,164,177,196,201,209],"undirected":[6,56],"graphs":[7,40],"have":[8],"been":[9],"used":[10],"to":[11,50],"model":[12],"problems":[13,23],"in":[14,18,24,69,78,133,137,150,156],"fault-tolerant":[15],"computing":[16],"parallel":[19,25],"process":[20,26],"scheduling.":[21],"However,":[22],"scheduling":[27],"are":[28,107,172],"more":[29],"accurately":[30],"modeled":[31],"by":[32],"stack":[33,43,52,99,135],"directed":[38],"acyclic":[39],"(dags).":[41],"A":[42,73],"layout":[44,53,75,100],"a":[46,51,87,203,211],"dag":[47,67,88,128,145,205],"is":[48,76,89],"similar":[49],"an":[55,79],"graph,":[57],"with":[58],"the":[59,63,66,90,110,199,207],"additional":[60],"requirement":[61],"that":[62],"nodes":[64],"be":[68,130,147],"some":[70],"topological":[71],"order.":[72],"defined":[77],"analogous":[80],"manner.":[81],"The":[82],"stacknumber":[83,111],"(":[84],"queuenumber)":[85],"smallest":[91],"number":[92],"stacks":[94,154],"(queues)":[95],"required":[96],"for":[97,187,198],"its":[98],"(queue":[101],"layout).":[102],"In":[103,124],"this":[104,178],"paper,":[105],"bounds":[106],"established":[108],"on":[109],"queuenumber":[113],"two":[115],"classes":[116],"dags:":[118],"tree":[119,127,166],"dags":[120,167,171,190,193],"unicyclic":[122,144],"dags.":[123],"particular,":[125,183],"any":[126,143],"can":[129,146],"laid":[131,148],"out":[132,149],"1":[134],"at":[138,151,157],"most":[139,152,158],"2":[140,153,159],"queues;":[141],"queues.":[160],"Forbidden":[161],"subgraph":[162],"characterizations":[163],"1-queue":[165,169,192],"cycle":[170],"also":[173],"presented.":[174],"Part":[175],"II":[176],"paper":[179],"presents":[180],"algorithmic":[181],"results---in":[182],"linear":[184],"time":[185],"algorithms":[186],"recognizing":[188,202,210],"1-stack":[189],"proof":[195],"NP-completeness":[197],"problem":[200,208],"4-queue":[204],"9-stack":[212],"dag.":[213]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}