A linear time algorithm for embedding Christmas trees into certain trees

DOI10.1142/S0129626415500085MaRDI QIDQ4598908zbMATH OpenFDO

Authors R. Sundara Rajan, Paul Manuel, Indra Rajasingh

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626415500085

zbMATH Keywords

Christmas treesdilationembeddingwirelength

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the complexity of tree embedding problems
• Optimal one-page tree embeddings in linear time
• Lattice embeddings of trees
• Minimum layout of circulant graphs into certain height balanced trees
• Embedding of cycles and wheels into arbitrary trees

Cited in

(8)

• The cyclic wirelength of trees
• Minimum layout of circulant graphs into certain height balanced trees
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles
• Minimum linear arrangement of the Cartesian product of optimal order graph and path
• Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
• Embedding of hypercube into fractal cubic network
• Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
• Embedding of extended Sierpinski networks \(S^{++}(k, m)\) into certain trees

This page was built for publication: A linear time algorithm for embedding Christmas trees into certain trees

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