\(k\)-edge subgraph problems (Q1356515): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4234074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3815886 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The dense \(k\)-subgraph problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4037432 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3128917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Node-and edge-deletion NP-complete problems / rank | |||
Normal rank |
Latest revision as of 13:10, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(k\)-edge subgraph problems |
scientific article |
Statements
\(k\)-edge subgraph problems (English)
0 references
7 September 1997
0 references
\(k\)-edge-incident subgraph problem
0 references
0 references