5889 search results - page 411 / 1178 » Graph Layout Problems |
155
click to vote
WG
2004
Springer
16 years 6 days ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
177
Voted
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
182
Voted
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
198
Voted
DAGM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
171
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...