Linear-time computation of optimal subgraphs of decomposable graphs (Q4728259)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4728259 |
scientific article; zbMATH DE number 4003543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8012859225273132
0 references
