463 search results - page 23 / 93 » The Most Reliable Subgraph Problem |
107
Voted
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
JGT
2007
15 years 1 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
128
click to vote
ICPADS
2005
IEEE
15 years 7 months ago
2005
IEEE
In the audit process of Internet activities of users in a local area network, one of the most difficult problems is the problem of source authentication i.e. establishing securely...
COCOON
2009
Springer
15 years 8 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
112
click to vote
SIGIR
2010
ACM
15 years 5 months ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...