1461 search results - page 137 / 293 » Complexity of Graph Covering Problems |
174
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
210
click to vote
TKDE
2012
13 years 8 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
136
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
Increasing system complexity and test cost demands new system-level solutions for mixed-signal systems. In this paper, we present a testability analysis and DfT insertion methodol...
166
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
179
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...