Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Every planar map is four colorable. I: Discharging / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Algorithms for Petersen's Matching Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Guarding polyhedral terrains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial theorem in plane geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge guarding polyhedral terrains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3799261 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4295776 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The four-colour theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4945523 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(03)00027-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061541114 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces |
scientific article |
Statements
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (English)
0 references
14 October 2003
0 references
linear-time algorithm
0 references
cover
0 references
faces
0 references
coloring
0 references
plane graph
0 references