A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs (Q4632175)
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: A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs |
scientific article; zbMATH DE number 7048077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs |
scientific article; zbMATH DE number 7048077 |
Statements
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (English)
0 references
26 April 2019
0 references
polynomial
0 references
algorithm
0 references
maximum internal spanning tree
0 references
interval graph
0 references
0 references
0 references
0.977992832660675
0 references
0.8684581518173218
0 references
0.8490694761276245
0 references
0.8403599858283997
0 references
0.8347718715667725
0 references
