On the Hardness and Approximability of Planar Biconnectivity Augmentation (Q5323069): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_25 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1560695543 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4037427 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Smallest Augmentation to Biconnect a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dividing a Graph into Triconnected Components / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-Line Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4472293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank |
Latest revision as of 20:22, 1 July 2024
scientific article; zbMATH DE number 5585625
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Hardness and Approximability of Planar Biconnectivity Augmentation |
scientific article; zbMATH DE number 5585625 |
Statements
On the Hardness and Approximability of Planar Biconnectivity Augmentation (English)
0 references
23 July 2009
0 references