Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 1985-1989  (4)
Material
Years
Year
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 8 (1988), S. 149-157 
    ISSN: 1439-6912
    Keywords: 05C38
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In a hereditary modular graphG, for any three verticesu, v, w of an isometric subgraph ofG, there exists a vertex of this subgraph that is simultaneously on some shortestu, v-path,u, w-path andv, w-path. It is shown that the hereditary modular graphs are precisely those bipartite graphs which do not contain any isometric cycle of length greater than four. There is a polynomial-time algorithm available which decides whether a given (bipartite) graph is hereditary modular or not. Finally, the chordal bipartite graphs are characterized by forbidden isometric subgraphs.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Bulletin of mathematical biology 51 (1989), S. 133-166 
    ISSN: 1522-9602
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract A new and apparently rather useful and natural concept in cluster analysis is studied: given a similarity measure on a set of objects, a sub-set is regarded as a cluster if any two objectsa, b inside this sub-set have greater similarity than any third object outside has to at least one ofa, b. These clusters then form a closure system which can be described as a hypergraph without triangles. Conversely, given such a system, one may attach some weight to each cluster and then compose a similarity measure additively, by letting the similarity of a pair be the sum of weights of the clusters containing that particular pair. The original clusters can be reconstructed from the obtained similarity measure. This clustering model is thus located between the general additive clustering model of Shepard and Arabie (1979) and the standard hierarchical model. Potential applications include fitting dendrograms with few additional nonnested clusters and simultaneous representation of some families of multiple dendrograms (in particular, two-dendrogram solutions), as well as assisting the search for phylogenetic relationships by proposing a somewhat larger system of possibly relevant “family groups”, from which an appropriate choice (based on additional insight or individual preferences) remains to be made.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Social choice and welfare 3 (1986), S. 125-145 
    ISSN: 1432-217X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Sociology , Economics
    Notes: Abstract Two questions concerning the location of a single facility by a voting process are investigated for transportation networks: - What is the maximum number of customers located on the network preferring some rival point over a voting solution? - How does the average distance of the customers to the facility increase when a voting location instead of a Weber location is chosen for the facility? Complete answers are given for general networks and for certain planar networks, viz., the so-called generalized cacti.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Archiv der Mathematik 52 (1989), S. 95-98 
    ISSN: 1420-8938
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...