48 search results - page 2 / 10 » Fixed Parameter Algorithms for the Minimum Weight Triangulat... |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
MST
2010
13 years 3 months ago
2010
ALGORITHMICA
2008
13 years 5 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
DAM
2008
13 years 4 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...