ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The equipartition polytope. II: Valid inequalities and facets (1990)
    Springer
    Mathematical programming 49 (1990), S. 71-90 
    Details
    ISSN: 1436-4646
    Keywords: Equipartition polytope ; cut polytope ; Boolean quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Theequipartition problem is defined as follows: given a graphG = (V, E) and edge weightsc e , partition the setV into two sets of ⌈1/2|V|⌉ and ⌊1/2|V|⌋ nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized. Anequicut is a feasible solution of the above problem and theequicut polytope Q(G) is the convex hull of the incidence vectors of equicuts inG. In this paper we describe some facet inducing inequalities of this polytope.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588779
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The equipartition polytope. I: Formulations, dimension and basic facets (1990)
    Springer
    Mathematical programming 49 (1990), S. 49-70 
    Details
    ISSN: 1436-4646
    Keywords: Equipartition polytope ; cut polytope ; Boolean quadratic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The following basic clustering problem arises in different domains, ranging from physics, statistics and Boolean function minimization. Given a graphG = (V, E) and edge weightsc e , partition the setV into two sets of ⌈1/2|V|⌉ and ⌊1/2|V|⌋ nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized. Anequicut is a feasible solution of the above problem and theequicut polytope Q(G) is the convex hull of the incidence vectors of equicuts inG. In this paper we give some integer programming formulations of the equicut problem, study the dimension of the equicut polytope and describe some basic classes of facet-inducing inequalities forQ(G).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588778
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The pigmentary system of planaria (1979)
    Springer
    Cell & tissue research 199 (1979), S. 197-202 
    Details
    ISSN: 1432-0878
    Keywords: Pigmentary system ; Planaria
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Medicine
    Notes: Summary The pigmentary system of the planaria, Dugesia gonocephala s.l. (Platyhelminthes, Turbellaria, Tricladida), has been studied by light and electron microscopy. The system consists of granules contained in chromatophore-like cells embedded in the parenchyma. The cell processes penetrate between the muscle layers and extend to the sub-epidermal basal lamina. The nature of the pigment and the comparative anatomical significance of the chromatophore structure is discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00236131
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    The pigmentary system of planaria (1979)
    Springer
    Cell & tissue research 199 (1979), S. 203-211 
    Details
    ISSN: 1432-0878
    Keywords: Pigmentary system ; Planaria ; MIF ; Hormonal regulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Medicine
    Notes: Summary The pigmentary system of the planaria, Dugesia gonocephala s.l. (Platyhelminthes, Turbellaria, Tricladida), consists of granules contained in chromatophore cells distributed in the parenchyma tissue. The administration of MSH release-Inhibiting Factor (M.I.F.) leads to an easily observable general decolouration of the animal due to the migration of the pigment granules towards the deeper-lying cell nucleus. In planarians bisected transversely through the pharyngeal region, the decolouration occurs only in the cephalic segment, and the caudal segment remains dark. When, however, the decapitated caudal segment regenerates a head region, a decolouration response occurs when exposed to M.I.F. The significance of these results is discussed, and an hypothesis on the hormonal regulation of the pigmentary system is proposed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00236132
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Perfect matchings in balanced hypergraphs (1996)
    Springer
    Combinatorica 16 (1996), S. 325-329 
    Details
    ISSN: 1439-6912
    Keywords: 05 C 65 ; 05 A 18 ; 05 C 70
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We generalize Hall's condition for the existence of a perfect matching in a bipartite graph, to balanced hypergraphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01261318
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...