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 条
  • [1] Fixed-Parameter Tractability for Branchwidth of the Maximum-Weight Edge-Colored Subgraph Problem
    Aloisio, Alessandro
    ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 6, AINA 2024, 2024, 204 : 86 - 95
  • [2] On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
    Federico Corò
    Gianlorenzo D’Angelo
    Vahan Mkrtchyan
    Theory of Computing Systems, 2020, 64 : 1094 - 1109
  • [3] On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
    Coro, Federico
    D'Angelo, Gianlorenzo
    Mkrtchyan, Vahan
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (06) : 1094 - 1109
  • [4] Fixed-parameter tractability of the Maximum Agreement Supertree problem
    Guillemot, Sylvain
    Berry, Vincent
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 274 - +
  • [5] Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
    Guillemot, Sylvain
    Berry, Vincent
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2010, 7 (02) : 342 - 353
  • [6] Fixed-parameter tractability for the Tree Assembly problem
    Shi, Feng
    You, Jie
    Zhang, Zhen
    Liu, Jingyi
    Wang, Jianxin
    THEORETICAL COMPUTER SCIENCE, 2021, 886 : 3 - 12
  • [7] Fixed-parameter tractability
    Samer, Marko
    Szeider, Stefan
    Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) : 425 - 454
  • [8] Fixed-Parameter Tractability of Maximum Colored Path and Beyond
    Fomin, Fedor, V
    Golovach, Petr A.
    Korhonen, Tuukka
    Simonov, Kirill
    Stamoulis, Giannos
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 3700 - 3712
  • [9] Fixed-Parameter Tractability of Maximum Colored Path and Beyond
    V. Fomin, Fedor
    Golovach, Petr a.
    Korhonen, Tuukka
    Simonov, Kirill
    Plattner, Hasso
    Stamoulis, Giannos
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (04)
  • [10] Scheduling and fixed-parameter tractability
    Mnich, Matthias
    Wiese, Andreas
    MATHEMATICAL PROGRAMMING, 2015, 154 (1-2) : 533 - 562
12345