Shallow grates

DOI10.1016/0304-3975(94)90135-XzbMath0791.05047OpenAlexW2913852242MaRDI QIDQ1314391

Maria M. Klawe

Publication date: 22 February 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90135-x

zbMATH Keywords

gratesacyclic digraphsSchnitger's graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A lower bound on the area of permutation layouts
• Sorting in \(c \log n\) parallel steps
• Expanding graphs contain all small trees
• Explicit constructions of linear-sized superconcentrators
• On sparse graphs with dense long paths
• How to share memory in a distributed system
• New lower bound techniques for VLSI

This page was built for publication: Shallow grates