Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:22, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the maximum internal spanning tree problem on interval graphs in polynomial time |
scientific article |
Statements
Solving the maximum internal spanning tree problem on interval graphs in polynomial time (English)
0 references
5 June 2018
0 references
polynomial
0 references
algorithm
0 references
maximum internal spanning tree
0 references
interval graph
0 references
