Sciweavers

110 search results - page 7 / 22
» Minimum Bounded Degree Spanning Trees
Sort
View
DM
2008
114views more  DM 2008»
15 years 6 months ago
Subdivisions of graphs: A generalization of paths and cycles
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
Ch. Sobhan Babu, Ajit A. Diwan
WINE
2009
Springer
83views Economy» more  WINE 2009»
16 years 18 days ago
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...
IPL
2007
81views more  IPL 2007»
15 years 5 months ago
Lower bounds for testing Euclidean Minimum Spanning Trees
Oren Ben-Zwi, Oded Lachish, Ilan Newman
NETWORKS
2010
15 years 4 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke