4171 search results - page 215 / 835 » Choice numbers of graphs |
190
click to vote
WADS
2005
Springer
16 years 4 days ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
170
click to vote
SRDS
1998
IEEE
15 years 11 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
206
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
155
click to vote
UAI
2004
15 years 8 months ago
2004
This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in w...
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...