823 search results - page 57 / 165 » Brick partitions of graphs |
173
click to vote
COMBINATORICS
2007
15 years 6 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. ...
133
click to vote
JCT
2006
15 years 6 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...
152
click to vote
ICPADS
2005
IEEE
15 years 11 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
200
click to vote
PE
2011
Springer
15 years 1 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
180
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....