335 search results - page 33 / 67 » How to Use Spanning Trees to Navigate in Graphs |
148
click to vote
GBRPR
2007
Springer
16 years 9 days ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
170
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
164
click to vote
PDPTA
2007
15 years 7 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
147
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
142
click to vote
IDA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...