Connectivity check in 3-connected planar graphs with obstacles (Q5300999): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2008.06.030 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2008.06.030 / rank | |||
Normal rank | |||
Latest revision as of 16:39, 30 December 2024
scientific article; zbMATH DE number 6182781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity check in 3-connected planar graphs with obstacles |
scientific article; zbMATH DE number 6182781 |
Statements
Connectivity check in 3-connected planar graphs with obstacles (English)
0 references
28 June 2013
0 references
planar graph
0 references
compact labelling scheme
0 references
connectivity
0 references
obstacles
0 references
