Efficient heuristics for the minimum labeling global cut problem (Q1791898): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2018.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2797445847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Variable neighbourhood search: methods and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating Minimum Label s-t Cut via Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for the Label Cut Problems / rank | |||
Normal rank | |||
Latest revision as of 19:57, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient heuristics for the minimum labeling global cut problem |
scientific article |
Statements
Efficient heuristics for the minimum labeling global cut problem (English)
0 references
11 October 2018
0 references
edge-labeled graphs
0 references
variable neighborhood search
0 references
connectivity
0 references
