The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability

被引：0
|
作者：
Mkrtchyan V. [1 ]
机构：
[1] Gran Sasso Science Institute, School of Advanced Studies, L’Aquila
来源：
Journal of Graph Algorithms and Applications | 2024年 / 28卷 / 01期
关键词：
Edge-coloring; exact algorithm; fixed-parameter tractability; maximum 2-edge-colorable subgraph;
D O I：
10.7155/jgaa.v28i1.2931
中图分类号：
学科分类号：
摘要：
A k-edge-coloring of a graph is an assignment of colors {1, …, k} to edges of the graph such that adjacent edges receive different colors. In the maximum k-edge-colorable subgraph problem we are given a graph and an integer k, the goal is to find a k-edge-colorable subgraph with maximum number of edges together with its k-edge-coloring. In this paper, we consider the maximum 2-edge-colorable subgraph problem and present some results that deal with the fixed-parameter tractability of this problem. © 2024, Brown University. All rights reserved.
引用
收藏
页码：129 / 147
页数：18
相关论文
共 50 条
  • [31] Fixed-Parameter Tractability of Token Jumping on Planar Graphs
    Ito, Takehiro
    Kaminski, Marcin
    Ono, Hirotaka
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 208 - 219
  • [32] FIXED-PARAMETER TRACTABILITY OF MULTICUT PARAMETERIZED BY THE SIZE OF THE CUTSET
    Marx, Daniel
    Razgon, Igor
    SIAM JOURNAL ON COMPUTING, 2014, 43 (02) : 355 - 388
  • [33] Fixed-parameter tractability of anonymizing data by suppressing entries
    Chaytor, Rhonda
    Evans, Patricia A.
    Wareham, Todd
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 23 - +
  • [34] Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables
    Robert Crowston
    Gregory Gutin
    Mark Jones
    Venkatesh Raman
    Saket Saurabh
    Anders Yeo
    Algorithmica, 2014, 68 : 739 - 757
  • [35] Fixed-Parameter Tractability of (n − k) List Coloring
    Aritra Banik
    Ashwin Jacob
    Vijay Kumar Paliwal
    Venkatesh Raman
    Theory of Computing Systems, 2020, 64 : 1307 - 1316
  • [36] FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .2. ON COMPLETENESS FOR W[1]
    DOWNEY, RG
    FELLOWS, MR
    THEORETICAL COMPUTER SCIENCE, 1995, 141 (1-2) : 109 - 131
  • [37] Fixed-parameter tractability of anonymizing data by suppressing entries
    Patricia A. Evans
    H. Todd Wareham
    Rhonda Chaytor
    Journal of Combinatorial Optimization, 2009, 18 : 362 - 375
  • [38] FIXED-PARAMETER TRACTABILITY OF MULTICUT IN DIRECTED ACYCLIC GRAPHS
    Kratsch, Stefan
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wahlstroem, Magnus
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (01) : 122 - 144
  • [39] Fixed-Parameter Tractability of (n - k) List Coloring
    Banik, Aritra
    Jacob, Ashwin
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 61 - 69
  • [40] Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
    Ganian, Robert
    Peitl, Tomas
    Slivovsky, Friedrich
    Szeider, Stefan
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 392 - 402
12345