• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Parameterized Orientable Deletion

Thumbnail
View/Open
Parameterized.pdf (3.254Mb)
Date
2020
Dewey
Modèles mathématiques. Algorithmes
Sujet
Orientation; Parameterization; Treewidth; SETH
Journal issue
Algorithmica
Volume
82
Number
7
Publication date
2020
Article pages
1909–1938
Publisher
Springer
DOI
http://dx.doi.org/10.1007/s00453-020-00679-6
URI
https://basepub.dauphine.fr/handle/123456789/20961
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Hanaka, Tesshu
Katsikarelis, Ioannis
Lampis, Michael
Otachi, Yota
Sikora, Florian
Type
Article accepté pour publication ou publié
Abstract (EN)
A graph is d-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most d. d-orientability is a well-studied concept with close connections to fundamental graph-theoretic notions and applications as a load balancing problem. In this paper we consider the d-ORIENTABLE DELETION problem: given a graph G=(V,E), delete the minimum number of vertices to make Gd-orientable. We contribute a number of results that improve the state of the art on this problem.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.