3471 search results - page 203 / 695 » Obstacle Numbers of Graphs |
164
click to vote
SIAMDM
2010
15 years 3 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
151
Voted
IV
2005
IEEE
15 years 10 months ago
2005
IEEE
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...
165
click to vote
WADS
2005
Springer
15 years 10 months 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...
145
Voted
SRDS
1998
IEEE
15 years 9 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...
171
Voted
SODA
2008
ACM
15 years 6 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...