Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (Q2894465): 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.1007/978-3-642-29344-3_17 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2208287652 / rank | |||
Normal rank |
Latest revision as of 00:47, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n |
scientific article |
Statements
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (English)
0 references
29 June 2012
0 references