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
Filter
  • Articles  (3)
  • Random graphs  (3)
  • Springer  (3)
  • American Geophysical Union (AGU)
  • Annual Reviews
  • 1980-1984  (3)
  • Economics  (3)
  • Geography
Collection
  • Articles  (3)
Source
Keywords
Publisher
  • Springer  (3)
  • American Geophysical Union (AGU)
  • Annual Reviews
Years
  • 1980-1984  (3)
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Probabilistic methods in graph theory (1984)
    Springer
    Annals of operations research 1 (1984), S. 171-182 
    Details
    ISSN: 1572-9338
    Keywords: Random graphs ; graph coloring ; tails of the binomial and the hypergeometric distributions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract One of the lessons Paul Erdös taught us is that probabilistic counting arguments often yield surprisingly strong existence results in combinatorics. This paper illustrates the paradigm on four examples drawn from Erdös's own work. The examples concern the chromatic number of a graph.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01874387
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A probabilistic analysis of some greedy cardinality matching algorithms (1984)
    Springer
    Annals of operations research 1 (1984), S. 239-254 
    Details
    ISSN: 1572-9338
    Keywords: Random graphs ; expectation of greedy matchings
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper deals with the expected cardinality of greedy matchings in random graphs. Different versions of the greedy heuristic for the cardinality matching problem are considered. Experimental data and some theoretical results are reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01874391
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Colouring random graphs (1984)
    Springer
    Annals of operations research 1 (1984), S. 183-200 
    Details
    ISSN: 1572-9338
    Keywords: Random graphs ; colouring ; probabilistic analysis of algorithms ; greedy heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We discuss some results concerned with the behaviour of colouring algorithms on large random graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01874388
    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...