Library

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
  • Electronic Resource  (2)
Source
Material
  • Electronic Resource  (2)
Years
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    An Augmentation Algorithm for the Maximum Weighted Stable Set Problem (1999)
    Springer
    Computational optimization and applications 14 (1999), S. 367-381 
    Details
    ISSN: 1573-2894
    Keywords: stable set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Edge projection is a specialization of Lovász and Plummer's clique reduction when restricted to edges. A concept of augmenting sequences of edge-projections is defined w.r.t. a stable set S. It is then proved the equivalence between the optimality of S and the existence of an augmenting sequence w.r.t. S. This result is then exploited to develop a new tabu-search heuristic for the Maximum Stable Set Problem (weighted and unweighted). The resulting code proved to be competitive with the best codes presented in the literature.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1026456624746
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    An exact algorithm for the maximum stable set problem (1994)
    Springer
    Computational optimization and applications 3 (1994), S. 243-258 
    Details
    ISSN: 1573-2894
    Keywords: Maximum stable set ; maximum clique ; branch-and-bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to ‘real-life’ problems show that the algorithm is competitive with the fastest algorithms known so far.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01299447
    Library Location Call Number Volume/Issue/Year 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...