Ram Narayan Yadav

4 Questions 11 Answers 0 Followers

Questions related from Ram Narayan Yadav

Any advice on a Maximum Order Degree-Constrainted Subgraph Problem ?

For a given (unweighted) graph G(V,E) with an integer d > 1. How to find a connected subgraph H of G with maximum |V(H)| and satisfying ∆(H) ≤ d (i.e. subgraph H is connected with the maximum...

12 December 2015 5,839 5 View

How do I find Hamiltonian cycle in given a nice tree decompositions?

Given a nice tree decomposition of width w of graph with n vertices, HAMILTONIAN CYCLE can be solved in time w^O(w ).n. Could anyone send me the papers related to finding Hamiltonian Cycle on nice...

08 August 2015 5,924 4 View

How is K-vertex connected minimal Steiner network problem ?

Could any one suggest me the paper related to k-vertex connected minimal Steiner network problem?

06 June 2015 6,380 4 View

Is there a minimum k-vertex connected subgraph containing a given set of vertices of a graph?

Let G(V,E) be an weighted, undirected, K-connected graph. Let N be subset of V. What is the best way to find the smallest connected subgraph G'(V',E') of G(V,E) such that N is a subset of V' and...

03 March 2015 701 7 View