Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (Q5287453): 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.1002/net.3230230307 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2050771261 / rank | |||
Normal rank |
Revision as of 00:32, 20 March 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