|
|
|
|
CONTRIBUTORS:
|
|
|
CONFERENCE NAME:
|
|
|
CONF. LOCATION:
|
Plovdiv, Bulgaria
|
|
CONFERENCE YEAR:
|
2007
|
|
PUB TYPE:
|
Conference Presentation
|
|
SUBJECT(S):
|
chemistry - computational; informatics - fundamentals; mathematics - applied; mathematics - number theory
|
|
DISCIPLINE:
|
No discipline assigned
|
|
HTTP:
|
http://lori.academicdirect.org/works/?f=143
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-436-928
(Last edited on
2007/08/20 01:25:53 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
We obtained a polynomial formula giving the number and size of substructures that result after removing of one vertex from a b-tree.
The solution proposed for this problem is presented by using of a polynomial formula. Two particular cases are presented.
The obtained polynomial formulas for vertex cuts in b-trees can be generalized, allowing calculations of any structures of interest. The obtained formula works also as limit formulas for trivial trees, which are paths.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
3
|
|
References
|
|
1
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/435
|
|
|
|
|
|
|
| Prev |
Next |
|
