1395 search results - page 130 / 279 » (k, )-Distance-Hereditary Graphs |
178
click to vote
IPL
2008
15 years 5 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
DM
2007
15 years 5 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
128
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
167
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
127
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...