1952 search results - page 161 / 391 » Complete partitions of graphs |
155
click to vote
COR
2007
15 years 4 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
133
click to vote
NN
2006
Springer
15 years 4 months ago
2006
Springer
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
122
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
154
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
138
click to vote
ACSD
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...