Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62048309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5687948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Augmentation Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692508 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3002852 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation Algorithms for Graph Augmentation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2770481 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252419 / rank | |||
Normal rank |
Latest revision as of 11:48, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Evolutionary local search for the edge-biconnectivity augmentation problem |
scientific article |
Statements
Evolutionary local search for the edge-biconnectivity augmentation problem (English)
0 references
14 July 2002
0 references
combinatorial problems
0 references
graph algorithms
0 references
evolutionary algorithms
0 references
interconnection networks
0 references
connectivity augmentation problems
0 references
0 references