#### Filter Results:

#### Publication Year

1989

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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)

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum diierence between labels of two incident edges. We prove that edge-bandwidth 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)

Problem statement: In this study researchers propose a new fuzzy graph theoretic construct called fuzzy metagraph and a new method of clustering finding the similar fuzzy nodes in a fuzzy metagraph. Approach: We adopted T-norms (Triangular Norms) functions and join two or more T-norms to cluster the fuzzy nodes. Fuzzy metagraph is the fuzzyfication of the… (More)

- Hitesh Kumar Sharma, Aditya Shastri, Ranjit Biswas
- 2012

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 cost-effective manner is a growing challenge. The total cost of… (More)

- Kumar Hitesh, Sharma, Ranjit Biswas, Aditya Shastri
- 2012

Modern data analysis applications are driven by the Network databases. They are pushing traditional database and data warehousing technologies beyond their limits due to their massively increasing data volumes and demands for low latency. There are three major challenges in working with network databases: interoperability due to heterogeneous data… (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)