760 search results - page 105 / 152 » Algorithms for finding clique-transversals of graphs |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
ESA
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
DIALM
2008
ACM
13 years 10 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
CNSR
2007
IEEE
14 years 23 days ago
2007
IEEE
Search engines have turned into one of the most important services of the Web that are frequently visited by any user. They assist their users in finding appropriate information. ...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...