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 条
  • [21] Parameterized Complexity of Maximum Edge Colorable Subgraph
    Agrawal, Akanksha
    Kundu, Madhumita
    Sahu, Abhishek
    Saurabh, Saket
    Tale, Prafullkumar
    ALGORITHMICA, 2022, 84 (10) : 3075 - 3100
  • [22] Parameterized Complexity of Maximum Edge Colorable Subgraph
    Akanksha Agrawal
    Madhumita Kundu
    Abhishek Sahu
    Saket Saurabh
    Prafullkumar Tale
    Algorithmica, 2022, 84 : 3075 - 3100
  • [23] On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
    Mkrtchyan V.
    Petrosyan G.
    Journal of Graph Algorithms and Applications, 2022, 26 (01) : 91 - 110
  • [24] Practical algorithms and fixed-parameter tractability for the single individual SNP Haplotyping Problem
    Rizzi, R
    Bafna, V
    Istrail, S
    Lancia, G
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2002, 2452 : 29 - 43
  • [25] Bounded fixed-parameter tractability:: The case 2poly(k)
    Weyer, M
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2004, 3162 : 49 - 60
  • [26] Fixed-parameter tractability of anonymizing data by suppressing entries
    Evans, Patricia A.
    Wareham, H. Todd
    Chaytor, Rhonda
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (04) : 362 - 375
  • [27] Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (04) : 1020 - 1034
  • [28] Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
    Marx, Daniel
    Razgon, Igor
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 469 - 478
  • [29] Fixed-Parameter Tractability of (n - k) List Coloring
    Banik, Aritra
    Jacob, Ashwin
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (07) : 1307 - 1316
  • [30] Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
    Kratsch, Stefan
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wahlstroem, Magnus
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 581 - 593
12345