Median problem in some plane triangulations and quadrangulations. (Q1428459)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2062737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Median problem in some plane triangulations and quadrangulations. |
scientific article; zbMATH DE number 2062737 |
Statements
Median problem in some plane triangulations and quadrangulations. (English)
0 references
29 March 2004
0 references
An new algorithm is introduced to compute the median set in two classes of face regular plane graphs: the plane triangulations with inner vertices of degree at least six and plane quadrangulations with inner vertices of degree at least four. The median set is computed in a time depending linearly on the vertices number.
0 references
median set
0 references
plane triangulation
0 references
linear-time algorithms
0 references
plane quadrangulations
0 references
0 references
0.7940996289253235
0 references
0.7883366346359253
0 references
0.7843928933143616
0 references
