335 search results - page 39 / 67 » How to Use Spanning Trees to Navigate in Graphs |
164
click to vote
WCRE
2008
IEEE
16 years 16 days ago
2008
IEEE
During software maintenance tasks, developers often spend an important amount of effort investigating source code. This effort can be reduced if tools are available to help develo...
152
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
184
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
166
click to vote
ISPA
2007
Springer
16 years 9 days ago
2007
Springer
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...
177
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...