1688 search results - page 85 / 338 » The Complexity of Rationalizing Matchings |
WG
2009
Springer
14 years 4 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Forward Error Correction (FEC) schemes are generally used in wireless communication systems to maintain an acceptable quality of service. Various models have been proposed in l...
ACSAC
2005
IEEE
14 years 3 months ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...