Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Variations of the maximum leaf spanning tree problem for bipartite graphs
Information Processing Letters
Variations of the maximum leaf spanning tree problem for bipartite graphs
Information Processing Letters
Spanning trees with many leaves in regular bipartite graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Hi-index | 0.89 |
This paper deals with the complexity issues of some new interesting spanning tree problems. Here we define some new spanning tree problems by imposing various constraints and restrictions on graph parameters and present relevant results. Also we introduce a new notion of ''set version'' of some decision problems having integer K