Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (Q5287453): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Combinatorial Decomposition Theory / rank | |||
Normal rank | |||
Latest revision as of 18:22, 17 May 2024
scientific article; zbMATH DE number 232945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs |
scientific article; zbMATH DE number 232945 |
Statements
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (English)
0 references
5 September 1993
0 references
2-connected Steiner subgraph problem
0 references
Halin graphs
0 references
\(W_ 4\)-free graphs
0 references
