A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
From MaRDI portal
Publication:4598908
DOI10.1142/S0129626415500085zbMath1376.68115MaRDI QIDQ4598908
R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh
Publication date: 15 December 2017
Published in: Parallel Processing Letters (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
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
This page was built for publication: A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
