On a universal chain problem

DOI10.1016/0166-218X(92)00178-OMaRDI QIDQ1317044zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Martin Dyer

Publication date 11 September 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(92)00178-o

zbMATH Keywords

finite discrete spaceparallel memory allocationuniversal chain

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Universal Chains and Wiring Layouts
• Universal Traversal Sequences
• An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
• On the number of discrete chains
• Problems on chain partitions

Cites work

• Universal Chains and Wiring Layouts

Cited in

(3)

• scientific article; zbMATH DE number 4177122 (Why is no real title available?)
• On the Chain Pair Simplification Problem
• Universal Chains and Wiring Layouts

This page was built for publication: On a universal chain problem

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