On the Complexity of the Balanced Vertex Ordering Problem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F05%3A00206129" target="_blank" >RIV/00216208:11320/05:00206129 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On the Complexity of the Balanced Vertex Ordering Problem

Original language description

We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices $v$, of the difference between the number of neighbours to the left and right of $v$. We show that this problem is NP-complete for graphs with maximum degree four, 5-regular graphs and planar graphs with maximum degree six. We introduce a polynomial time algorithm that determines whether there is a vertex ordering with total imbalance smaller than a fixed constant.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Computing and Combinatorics, proceedings

ISBN

3-540-28061-8

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

Berlin

Event date

Jan 1, 2005

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000231866900086