4865 search results - page 462 / 973 » The Complexity of Graph Connectivity |
164
click to vote
COCOA
2008
Springer
15 years 8 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...
191
click to vote
APBC
2003
15 years 8 months ago
2003
Databases contain a large amount of data about metabolic pathways, in particular about similar pathways in different species. Biologists are familiar with visual representations ...
201
click to vote
DBSEC
2009
15 years 8 months ago
2009
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
168
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
185
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...