1933 search results - page 17 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
PROCEDIA
2010
13 years 5 months ago
2010
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
ALGORITHMICA
1998
13 years 7 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
JCO
2008
13 years 7 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...