Algorithmic approach to the satisfactory graph partitioning problem (Q1580976): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Daniel Kobler / rank | |||
Property / author | |||
Property / author: Daniel Kobler / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4012216 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for the maximum satisfiability problem / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00459-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2039311359 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:11, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic approach to the satisfactory graph partitioning problem |
scientific article |
Statements
Algorithmic approach to the satisfactory graph partitioning problem (English)
0 references
23 November 2000
0 references
graph theory
0 references
graph partition
0 references
heuristic algorithms
0 references