2503 search results - page 239 / 501 » A study of 3-arc graphs |
151
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
165
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
216
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
194
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
210
click to vote
CCCG
2009
15 years 7 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...