Sciweavers

6 search results - page 1 / 2
» Level of Repair Analysis and Minimum Cost Homomorphisms of G...
Sort
View
AAIM
2005
Springer
173views Algorithms» more  AAIM 2005»
13 years 10 months ago
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gregory Gutin, Arash Rafiey, Anders Yeo, Michael T...
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 4 months ago
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jun...
ICC
2009
IEEE
103views Communications» more  ICC 2009»
13 years 11 months ago
On the Minimum k-Connectivity Repair in Wireless Sensor Networks
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
Hisham M. Almasaeid, Ahmed E. Kamal
ACSAC
2003
IEEE
13 years 10 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...