On the public citation graph
Embedding Complete Binary Trees into Star and Pancake Graphs
0 signed · 25 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199905)33:3<221::aid-net8>3.0.co;2-kopenalex-snapshot
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
inferred← citeshttps://doi.org/10.1002/net.20027openalex-snapshot
Embedding of cycles and wheels into arbitrary trees
inferred← citeshttps://doi.org/10.1002/net.20078openalex-snapshot
Mutually independent hamiltonian paths in star networks
inferred← citeshttps://doi.org/10.1002/net.20135openalex-snapshot
On the spanningw‐wide diameter of the star graph
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_2openalex-snapshot
Comparing Star and Pancake Networks
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_73openalex-snapshot
Embedding complete binary trees into star networks
inferred← citeshttps://doi.org/10.1007/s00224-001-1034-2openalex-snapshot
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
inferred← citeshttps://doi.org/10.1007/s11227-020-03297-9openalex-snapshot
Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks
inferred← citeshttps://doi.org/10.1016/b978-1-78548-274-8.50006-4openalex-snapshot
One-by-One Embedding of the Twisted Hypercube into Pancake Graph
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.001openalex-snapshot
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.02.007openalex-snapshot
The super connectivity of the pancake graphs and the super laceability of the star graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00510-0openalex-snapshot
Ring embedding in faulty pancake graphs
inferred← citeshttps://doi.org/10.1080/00207160701619200openalex-snapshot
Largest connected component of a star graph with faulty vertices
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750613openalex-snapshot
Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph
inferred← citeshttps://doi.org/10.1109/hicss.1995.375502openalex-snapshot
Embeddings of complete binary trees into star graphs with congestion 1
inferred← citeshttps://doi.org/10.1109/hipc.1996.565815openalex-snapshot
Congestion-free dilation-2 embedding of full binary trees on star graphs
inferred← citeshttps://doi.org/10.1109/hpc.1997.592125openalex-snapshot
Embeddings into the pancake interconnection network
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300536openalex-snapshot
The spanning diameter of the star graphs
inferred← citeshttps://doi.org/10.1142/s0129626402001002openalex-snapshot
EMBEDDINGS INTO THE PANCAKE INTERCONNECTION NETWORK
inferred← citeshttps://doi.org/10.1142/s0129626415500085openalex-snapshot
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
inferred← citeshttps://doi.org/10.1142/s0219265908002175openalex-snapshot
CONDITIONAL DIAGNOSABILITY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL
inferred← citeshttps://doi.org/10.14257/ijseia.2016.10.3.17openalex-snapshot
Embedding Algorithm among Half Pancake, Pancake, and Star Graphs
inferred← citeshttps://doi.org/10.5120/9950-4597openalex-snapshot
Embedding of C_n^2 and C_(n-1)^2+K_1 in to Arbitrary Tree
inferred← citeshttps://doi.org/10.9734/bjmcs/2012/872openalex-snapshot
Embedding n-Dimensional Crossed Hypercube into Pancake Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.