1729 search results - page 164 / 346 » Bound Graph Polysemy |
159
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
220
click to vote
ICDCS
2008
IEEE
16 years 26 days ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
189
click to vote
VISSOFT
2005
IEEE
16 years 43 min ago
2005
IEEE
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...
175
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
207
click to vote
ALT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...