Very cost effective bipartitions in graphs (Q322000): 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2306121223 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unfriendly partitions of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The satisfactory partition problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic approach to the satisfactory graph partitioning problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4820779 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2869348 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4028537 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4405794 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3211331 / rank | |||
Normal rank | |||
Latest revision as of 17:20, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Very cost effective bipartitions in graphs |
scientific article |
Statements
Very cost effective bipartitions in graphs (English)
0 references
14 October 2016
0 references
cost effective bipartition
0 references
very cost effective bipartition
0 references
