#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1989

2015

- This year (0)
- Last 5 years (9)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jerrold R. Griggs, Daniel J. Kleitman, Aditya Shastri
- Journal of Graph Theory
- 1989

We consider the problem of finding a spanning tree that maximizes the number of leaves (MaxLeaf). We provide a 3/2-approximation algorithm for this problem when restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(G), and construct a tree with at least (n−x(G)+4)/3… (More)

With the exponential growth of networked system and application such as eCommerce, the demand for effective internet security is increasing. Cryptology is the science and study of systems for secret communication. It consists of two complementary fields of study: cryptography and cryptanalysis. The application of genetic algorithms in the cryptanalysis of… (More)

- Aditya Shastri
- COCOON
- 1995

- Aditya Shastri
- Discrete Applied Mathematics
- 1998

- G. W. Peck, Aditya Shastri
- Discrete Mathematics
- 1992

- Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West
- SIAM J. Discrete Math.
- 1999

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edgebandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly sharp bounds on the change in edge-bandwidth… (More)

Business Data always growth from kilo byte, mega byte, giga byte, tera byte, peta byte, and so far. There is no way to avoid this increasing rate of data till business still running. Because of this issue, database tuning be critical part of a information system. Tuning a database in a costeffective manner is a growing challenge. The total cost of ownership… (More)

A wireless ad-hoc network comprises of a set of wireless nodes and requires no fixed infrastructure. For efficient communication between nodes, ad-hoc networks are typically grouped in to clusters, where each cluster has a clusterhead (or Master). In our study, we will take a communication model that is derived from that of BlueTooth. Clusterhead nodes are… (More)

Database administrators should be aware of resource usages to maintain database system performance. As database applications become more complex and diverse, managing database systems becomes too costly and prone to error. Autonomic database tuning becomes more important than ever. One of the major issues to address in regards to ORACLE database performance… (More)

- Aditya Shastri
- Discrete Mathematics
- 1990