Imbalance is fixed parameter tractable

In the Imbalance Minimization problem we are given a graph G=(V,E) and an integer b and asked whether there is an ordering v1…vn of V such that the sum of the imbalance of all the vertices is at most b. The imbalance of a vertex vi is the absolute value of the difference between the number of neighb...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 113; číslo 19-21; s. 714 - 718
Hlavní autori:	Lokshtanov, Daniel, Misra, Neeldhara, Saurabh, Saket
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.09.2013 Elsevier Sequoia S.A
Predmet:	Algorithms Balancing Computer science Data processing Fixed-parameter tractable algorithm Graph layout problems Graph theory Graphs Imbalance Integer programming Lectures Mathematical problems Numerical analysis Optimization Order disorder Parameterized complexity Studies Graph layout problems Algorithms Imbalance Parameterized complexity Fixed-parameter tractable algorithm
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!