Sciweavers

ACSAC
2010
IEEE
13 years 3 months ago
Friends of an enemy: identifying local members of peer-to-peer botnets using mutual contacts
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
Baris Coskun, Sven Dietrich, Nasir D. Memon
DAM
1999
128views more  DAM 1999»
13 years 11 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 4 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev