2314 search results - page 95 / 463 » Minimal Partitions of a Graph |
121
Voted
CSDA
2006
15 years 3 months ago
2006
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
101
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
132
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
108
Voted
JCT
2006
15 years 3 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
111
Voted
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
—A shared bus is a suitable structure for minimizing the interconnections costs in system synthesis. It has also been shown that the word-length of Functional Units has a great i...