Chordal Editing is Fixed-Parameter Tractable

Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 75; číslo 1; s. 118 - 137
Hlavní autoři:	Cao, Yixin, Marx, Dániel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.05.2016
Témata:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Chordal deletion Parameterized computation Clique tree decomposition Chordal completion Chordal graph Graph modification problems Holes Simplicial vertex sets
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!