Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (Q3613765)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5528727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems |
scientific article; zbMATH DE number 5528727 |
Statements
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (English)
0 references
12 March 2009
0 references
weighted graphs
0 references
minimum weight subgraph
0 references
algorithm
0 references
fast matrix multiplication
0 references
vertex weighted graphs
0 references
rectangular matrix multiplication
0 references
edge weigted graphs
0 references
smallest cycle
0 references
0.879889190196991
0 references
0.8497165441513062
0 references
0.8437201380729675
0 references
0.8288850784301758
0 references
0.8189125061035156
0 references
