Sciweavers

3268 search results - page 262 / 654
» The hub number of a graph
Sort
View
BMCBI
2006
184views more  BMCBI 2006»
15 years 6 months ago
PathSys: integrating molecular interaction graphs for systems biology
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...
Michael Baitaluk, Xufei Qian, Shubhada Godbole, Al...
COMCOM
2006
88views more  COMCOM 2006»
15 years 6 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
16 years 5 days ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
MST
2002
152views more  MST 2002»
15 years 6 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir