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...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 113; no. 19-21; pp. 714 - 718
Main Authors:	Lokshtanov, Daniel, Misra, Neeldhara, Saurabh, Saket
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.09.2013 Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!