Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2757350721 / rank | |||
Normal rank | |||
Revision as of 23:07, 19 March 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
