688 search results - page 38 / 138 » General Partitioning on Random Graphs |
110
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
117
Voted
TCAD
2002
15 years 1 days ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
100
Voted
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
85
Voted
GLVLSI
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improv...
115
click to vote
ORDER
2008
15 years 10 days ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...