Directed maximal-cut problems (Q1169817): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(82)90125-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2026169186 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Code Generation for Expressions with Common Subexpressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3919065 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3916590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Directed maximal-cut problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank |
Latest revision as of 17:00, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Directed maximal-cut problems |
scientific article |
Statements
Directed maximal-cut problems (English)
0 references
1982
0 references
NP-complete
0 references
efficient algorithm
0 references
directed graphs
0 references
maximal-cut
0 references