About: Parameterized Algorithms for Modular-Width

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

About: Parameterized Algorithms for Modular-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	It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILP and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the “price of generality” paid by clique-width. It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILP and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the “price of generality” paid by clique-width. (en)
Title	Parameterized Algorithms for Modular-Width Parameterized Algorithms for Modular-Width (en)
skos:prefLabel	Parameterized Algorithms for Modular-Width Parameterized Algorithms for Modular-Width (en)
skos:notation	RIV/00216224:14330/13:00066750!RIV14-MSM-14330___
http://linked.open...avai/predkladatel	Fakulta informatiky
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(EE2.3.30.0009), P(GAP202/11/0196)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Gajarský, Jakub Ordyniak, Sebastian
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	95319
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/13:00066750
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	parameterized complexity; modular width; shrub depth; chromatic number; hamiltonian path (en)
http://linked.open.../riv/klicoveSlovo	parameterized complexity hamiltonian path modular width shrub depth chromatic number
http://linked.open...ontrolniKodProRIV	[43966983D018]
http://linked.open...v/mistoKonaniAkce	Sophia Antipolis, France
http://linked.open...i/riv/mistoVydani	Berlin Heidelberg
http://linked.open...i/riv/nazevZdroje	Parameterized and Exact Computation
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (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 Employment of Newly Graduated Doctors of Science for Scientific Excellence
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Ordyniak, Sebastian Gajarský, Jakub Lampis, Michael
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-01-01 (xsd:date)
issn	0302-9743
number of pages	14 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-03898-8_15
http://purl.org/ne...btex#hasPublisher	Springer International Publishing
https://schema.org/isbn	9783319038971
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