A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175)
From MaRDI portal
scientific article; zbMATH DE number 7048077
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
