Recognizing Map Graphs of Bounded Treewidth

A map is a partition of the sphere into interior-disjoint regions homeomorphic to closed disks. Some regions are labeled as nations, while the remaining ones are labeled as holes. A map in which at most k nations touch at the same point is a k -map, while it is hole-free if it contains no holes. A g...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 86; číslo 2; s. 613 - 637
Hlavní autoři:	Angelini, Patrizio, Bekos, Michael A., Da Lozzo, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.02.2024 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Mathematics of Computing Theory of Computation Fixed-parameter tractability Map graphs K-map graphs Treewidth
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!