A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7035841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs |
scientific article; zbMATH DE number 7035841 |
Statements
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (English)
0 references
13 March 2019
0 references
locally connected spanning tree
0 references
partial \(k\) trees
0 references
SC \(k\)-trees
0 references
2-trees
0 references
chordal graphs
0 references
planar graphs
0 references
0 references
0 references
0 references
0.8709931373596191
0 references
0.8709931373596191
0 references
0.863476574420929
0 references
0.8600826859474182
0 references
0.8512904047966003
0 references
