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!
Popis
Shrnutí: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 neighbors to the left and right of vi. The problem is also known as the Balanced Vertex Ordering problem and it finds many applications in graph drawing. We show that this problem is fixed parameter tractable and provide an algorithm that runs in time 2O(blogb)⋅nO(1). This resolves an open problem of Kára et al. [On the complexity of the balanced vertex ordering problem, in: COCOON, in: Lecture Notes in Comput. Sci., vol. 3595, 2005, pp. 849–858]. •The Imbalance Minimization problem on graphs asks for an ordering of the vertices such that the total imbalance is minimized.•The problem finds several applications in graph drawing, and is known to be NP-hard.•In this article, we show that the problem is fixed parameter tractable, when parameterized by the solution size, resolving an open question from the literature.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2013.06.010