2304 search results - page 79 / 461 » On the Vulnerability of Large Graphs |
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
101
click to vote
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
107
click to vote
ACSAC
2005
IEEE
15 years 5 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
WADS
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
154
click to vote
BMCBI
2007
14 years 12 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...