Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal:

Search In Journal Title:

Abbravation:

Search In Journal Abbravation:

Publisher

Springer, Berlin, Heidelberg

Search In Publisher:

DOI

10.1002/nem.522

Search In DOI:

ISSN

Search In ISSN:
Search In Title Of Papers:

Width of a General Tree for Packet Routing

Authors: Hitesh Nimbark Shobhen Gohel Nishant Doshi
Publish Date: 2011/3/10
Volume: , Issue: , Pages: 322-324
PDF Link

Abstract

Till date in all the books they talks about height of a general tree like height balanced tree In this paper we talk about width of a general tree Width of a general tree is defined as number of nodes at each level and maximum of them The recursive algorithm for width has been given Later in the paper the iterative version using the stack is given


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


    Search Result: