An Optimal Level of Adding Edges for a Simple Path to a Complete K-ary Tree
Kiyoshi Sawada, Sio-Iong Ao, Hideki Katagir, Li Xu, Alan H. S. Chan · AIP conference proceedings · 2010
Views Icon Views Article contents Figures & tables Video Audio Supplementary Data Peer Review Share Icon Share Twitter Facebook Reddit LinkedIn Tools Icon Tools Reprints and Permissions Cite Icon Cite Search Site Citation Kiyoshi Sawada; An Optimal Level of Adding Edges for a Simple Path to a Complete K‐ary Tree. AIP Conference Proceedings 15 October 2010; 1285 (1): 158–164. https://doi.org/10.1063/1.3510543 Download citation file: Ris (Zotero) Reference Manager EasyBib Bookends Mendeley Papers EndNote RefWorks BibTex toolbar search Search Dropdown Menu toolbar search search input Search input auto suggest filter your search All ContentAIP Publishing PortfolioAIP Conference Proceedings Search Advanced Search |Citation Search