796 search results - page 41 / 160 » The Anonymous Subgraph Problem |
80
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
92
Voted
STOC
2003
ACM
16 years 29 days ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
97
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
117
Voted
ISSTA
2009
ACM
15 years 7 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
VLDB
2007
ACM
15 years 6 months ago
2007
ACM
PageRank-style authority analyses of Web graphs are of great importance for Web mining. Such authority analyses also apply to hot “Web 2.0” applications that exhibit a natural...