4171 search results - page 244 / 835 » Choice numbers of graphs |
186
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
172
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
162
click to vote
TSMC
2008
15 years 6 months ago
2008
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
160
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
176
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...