194 search results - page 3 / 39 » The Polytope of Degree Partitions |
ALGORITHMICA
2007
13 years 5 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
SIAMDM
2008
13 years 4 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
CORR
2010
Springer
12 years 12 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
ICCAD
2003
IEEE
2003
IEEE
Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization
14 years 1 months ago
In this paper we present a family of multi-objective hypergraph partitioning algorithms based on the multilevel paradigm, which are capable of producing solutions in which both th...
COMBINATORICS
2007
13 years 4 months ago
2007
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...