scientific article; zbMATH DE number 6472620

MaRDI QIDQ5501822zbMATH OpenFDO

Authors Louxin Zhang

Publication date 14 August 2015

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(3)

• On-line matching routing on trees
• Direct routing: Algorithms and complexity
• Optimal permutation routing for low-dimensional hypercubes

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 Q5501822)