Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107)
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: Algorithms for maximum internal spanning tree problem for some graph classes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for maximum internal spanning tree problem for some graph classes |
scientific article |
Statements
Algorithms for maximum internal spanning tree problem for some graph classes (English)
0 references
31 October 2022
0 references
maximum internal spanning tree
0 references
bipartite graphs
0 references
chordal graphs
0 references
optimal path cover
0 references
NP-completeness
0 references
graph algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.8601354956626892
0 references
0.8490694761276245
0 references
0.8442114591598511
0 references
0.8323766589164734
0 references
0.8235927820205688
0 references
