scientific article; zbMATH DE number 431507

MaRDI QIDQ3138282zbMATH OpenFDO

Authors Lenwood S. Heath, Ann Trenk, Sriram Pemmaraju

Publication date 2 January 1994

zbMATH Keywords

NP-completeundirected graphsparallel processingVLSI designqueue layoutsfault tolerant computinglayouts of directed acyclic graphsstack layouts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Stack and queue layouts of some graph products
• Stacks, queues and tracks: layouts of graph subdivisions
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Queue layouts of iterated line directed graphs
• Stack and Queue Layouts of Posets
• Laying Out Graphs Using Queues

Cited in

(6)

• Laying Out Graphs Using Queues
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and queue number of 2-trees
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Recognizing DAGs with page-number 2 is NP-complete
• Stack and queue layouts of some graph products

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138282)