Linear-time computation of optimal subgraphs of decomposable graphs (Q4728259): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29307016, #quickstatements; #temporary_batch_1709738850358 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(87)90039-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016056456 / rank | |||
Normal rank | |||
Latest revision as of 14:28, 19 March 2024
scientific article; zbMATH DE number 4003543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time computation of optimal subgraphs of decomposable graphs |
scientific article; zbMATH DE number 4003543 |
Statements
Linear-time computation of optimal subgraphs of decomposable graphs (English)
0 references
1987
0 references
combinatorial optimization
0 references
computational graph theory
0 references
weighted graph
0 references
matching
0 references
traveling salesman
0 references
linear-time algorithms
0 references
irredundance number of a tree
0 references
