Polynomial Cases for the Vertex Coloring Problem (English)
- New search for: Karthick, T.
- New search for: Maffray, Frédéric
- New search for: Pastor, Lucas
- New search for: Karthick, T.
- New search for: Maffray, Frédéric
- New search for: Pastor, Lucas
In:
Algorithmica
;
81
, 3
;
1053-1074
;
2018
- Article (Journal) / Electronic Resource
-
Title:Polynomial Cases for the Vertex Coloring Problem
-
Contributors:
-
Published in:Algorithmica ; 81, 3 ; 1053-1074
-
Publisher:
- New search for: Springer US
-
Place of publication:New York
-
Publication date:2018-05-21
-
Size:22 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 81, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 917
-
Edge Bipartization Faster than $$2^k$$Pilipczuk, Marcin / Pilipczuk, Michał / Wrochna, Marcin et al. | 2017
- 967
-
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant ModelBaswana, Surender / Choudhary, Keerti / Roditty, Liam et al. | 2018
- 986
-
Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal CliquesLiedloff, Mathieu / Montealegre, Pedro / Todinca, Ioan et al. | 2018
- 1006
-
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-MedianBehsaz, Babak / Friggstad, Zachary / Salavatipour, Mohammad R. / Sivakumar, Rohit et al. | 2018
- 1031
-
Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension GraphsFeldmann, Andreas Emil et al. | 2018
- 1053
-
Polynomial Cases for the Vertex Coloring ProblemKarthick, T. / Maffray, Frédéric / Pastor, Lucas et al. | 2018
- 1075
-
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network DesignFriggstad, Zachary / Rezapour, Mohsen / Salavatipour, Mohammad R. / Soto, Jose A. et al. | 2018
- 1096
-
Station Assignment with ReallocationHalper, Austin / Mosteiro, Miguel A. / Rossikova, Yulia / Wong, Prudence W. H. et al. | 2018
- 1126
-
The Minimum Feasible Tileset ProblemDisser, Yann / Kratsch, Stefan / Sorge, Manuel et al. | 2018
- 1152
-
On the Separation and Equivalence of Paging Strategies and Other Online AlgorithmsAngelopoulos, Spyros / Dorrigiv, Reza / López-Ortiz, Alejandro et al. | 2018
- 1180
-
Space-Efficient Biconnected Components and Recognition of Outerplanar GraphsKammer, Frank / Kratsch, Dieter / Laudahn, Moritz et al. | 2018
- 1205
-
Distributed Methods for Computing Approximate EquilibriaCzumaj, Artur / Deligkas, Argyrios / Fasoulakis, Michail / Fearnley, John / Jurdziński, Marcin / Savani, Rahul et al. | 2018
- 1232
-
Faster Algorithms for Security Games on MatroidsBaïou, Mourad / Barahona, Francisco et al. | 2018
- 1247
-
The Power and Limitations of Uniform Samples in Testing Properties of FiguresBerman, Piotr / Murzabulatov, Meiram / Raskhodnikova, Sofya et al. | 2018
- 1267
-
Parameterized Algorithms for List K-CyclePanolan, Fahad / Saurabh, Saket / Zehavi, Meirav et al. | 2018
- 1288
-
Deterministic Parallel Algorithms for Bilinear Objective FunctionsHarris, David G. et al. | 2018