Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710): 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.1016/0304-3975(91)90020-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022783258 / rank | |||
Normal rank |
Revision as of 00:43, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Planar orientations with low out-degree and compaction of adjacency matrices |
scientific article |
Statements
Planar orientations with low out-degree and compaction of adjacency matrices (English)
0 references
26 June 1992
0 references
A \(d\)-bounded orientation of an undirected graph is an orientation of its edges so that each vertex has outdegree at most \(d\). It is shown that planar graphs have 3-bounded orientations and they have 5-bounded acyclic orientations, both of which can be constructed in linear time. Parallel algorithms are given for finding 3-bounded orientations and 6-bounded acyclic orientations of planar graphs that do not require a planar embedding to be provided. Similar results are established for outerplanar and series-parallel graphs. Applications to compact data structures for representing planar graphs, using linear space but providing a constant time method for deciding adjacency of two vertices, are discussed.
0 references
planar graphs
0 references
orientations
0 references