2487 search results - page 300 / 498 » Partitions of Graphs into Trees |
120
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
123
Voted
AIPS
2008
15 years 5 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
131
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
137
Voted
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
146
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...