370 search results - page 15 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
114
click to vote
CCCG
2009
15 years 23 days 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...
89
Voted
WG
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
92
Voted
MFCS
1998
Springer
15 years 3 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
103
click to vote
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
MST
2006
14 years 11 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...