743 search results - page 64 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
SAC
2003
ACM
14 years 1 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...