1 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
4 papers · 1 filter
Hamiltonian Graphs and the Traveling Salesman Problem
Dhananjay P. Mehendale
A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. Based on this new characterization, a new exact polynomial time algorithm for the traveling salesman…
A New Algorithm for Linear Programming
Dhananjay P. Mehendale
We propose a new polynomial-time algorithm for linear programming. We further extend the ideas used in this new linear programming algorithm for nonlinear programming problems. The…
On Problems Related to Primes: Some Ideas
Dhananjay P. Mehendale
We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples le…
The Reconstruction of Graphs
Dhananjay P. Mehendale
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equi…