About: Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded rank-width and on digraphs of bounded bi-rank-width in polynomial (XP, to be precise) time. These include, particularly, graph coloring and chromatic polynomial problems, the Hamiltonian path and c-min-leaf outbranching, the directed cut, and more generally MSOL-partitioning problems on digraphs. Our focus on a formally clean and unified approach for the considered algorithmic problems is in contrast with many previous published XP algorithms running on graphs of bounded clique-width, which mostly used ad hoc techniques and ideas. The new contributions include faster algorithms for computing the chromatic number and the chromatic polynomial on graphs of bounded rank-width, and new algorithms for solving the defective coloring, the min-leaf outbranching, and the directed cut problems. In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded rank-width and on digraphs of bounded bi-rank-width in polynomial (XP, to be precise) time. These include, particularly, graph coloring and chromatic polynomial problems, the Hamiltonian path and c-min-leaf outbranching, the directed cut, and more generally MSOL-partitioning problems on digraphs. Our focus on a formally clean and unified approach for the considered algorithmic problems is in contrast with many previous published XP algorithms running on graphs of bounded clique-width, which mostly used ad hoc techniques and ideas. The new contributions include faster algorithms for computing the chromatic number and the chromatic polynomial on graphs of bounded rank-width, and new algorithms for solving the defective coloring, the min-leaf outbranching, and the directed cut problems. (en)
Title	Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width (en)
skos:prefLabel	Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width (en)
skos:notation	RIV/00216224:14330/13:00065951!RIV14-GA0-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP202/11/0196), P(GC201/09/J021)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Obdržálek, Jan Ganian, Robert Hliněný, Petr
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	112598
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/13:00065951
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	rank-width; XP algorithm; coloring (en)
http://linked.open.../riv/klicoveSlovo	coloring rank-width XP algorithm
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[8E4EE527D35D]
http://linked.open...i/riv/nazevZdroje	European Journal of Combinatorics
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Well-structured combinatorial classes, width parameters, and design of efficient algorithms Structural graph theory and parameterized complexity
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	34
http://linked.open...iv/tvurceVysledku	Ganian, Robert Hliněný, Petr Obdržálek, Jan
http://linked.open...ain/vavai/riv/wos	000314075000012
issn	0195-6698
number of pages	22 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.ejc.2012.07.024
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software