1461 search results - page 109 / 293 » Complexity of Graph Covering Problems |
171
click to vote
DISOPT
2010
15 years 5 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
145
Voted
GI
2003
Springer
15 years 10 months ago
2003
Springer
: The integrated approach for analysis of Large Complex Critical Infrastructures (LCCIs) to afford survivability aimed at preparing a Roadmap for Research and Development for criti...
168
click to vote
SRDS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
108
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
143
Voted
GD
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...