5889 search results - page 207 / 1178 » Graph Layout Problems |
142
click to vote
IPL
2007
15 years 6 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
168
click to vote
AUIC
2005
IEEE
16 years 2 days ago
2005
IEEE
The augmented desk is gaining popularity in recent HCI research. Its layout of a large horizontal screen on the desk enhances immersive and intense collaborative experiences. A re...
179
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
155
click to vote
ICDM
2005
IEEE
16 years 2 days ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
155
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...