222 search results - page 14 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
SODA
1992
ACM
13 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
MP
2006
13 years 7 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...