About: On the Complexity of the Balanced Vertex Ordering Problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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.
  • 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. (en)
Title
  • On the Complexity of the Balanced Vertex Ordering Problem
  • On the Complexity of the Balanced Vertex Ordering Problem (en)
skos:prefLabel
  • On the Complexity of the Balanced Vertex Ordering Problem
  • On the Complexity of the Balanced Vertex Ordering Problem (en)
skos:notation
  • RIV/00216208:11320/05:00206129!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 534441
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/05:00206129
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Complexity; Balanced; Vertex; Ordering; Problem (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [AF2F1E2479AA]
http://linked.open...v/mistoKonaniAkce
  • Berlin
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Computing and Combinatorics, proceedings
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kratochvíl, Jan
  • Kára, Jan
  • Wood, David
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000231866900086
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 3-540-28061-8
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software