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 条
  • [41] Fixed-parameter tractability and data reduction for multicut in trees
    Guo, J
    Niedermeier, R
    NETWORKS, 2005, 46 (03) : 124 - 135
  • [42] Fixed-Parameter Tractability and Characterizations of Small Special Treewidth
    Bodlaender, Hans L.
    Kratsch, Stefan
    Kreuzen, Vincent J. C.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 88 - 99
  • [43] Fixed-parameter tractability and lower bounds for stabbing problems
    Giannopoulos, Panos
    Knauer, Christian
    Rote, Guenter
    Werner, Daniel
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (07): : 839 - 860
  • [44] On fixed-parameter tractability and approximability of NP optimization problems
    Cai, LM
    Chen, JN
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 54 (03) : 465 - 474
  • [45] Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables
    Crowston, Robert
    Gutin, Gregory
    Jones, Mark
    Raman, Venkatesh
    Saurabh, Saket
    Yeo, Anders
    ALGORITHMICA, 2014, 68 (03) : 739 - 757
  • [46] Fixed-Parameter Tractability of Integer Generalized Scoring Rules
    Xia, Lirong
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 1599 - 1600
  • [47] Fixed-parameter tractability, definability, and model-checking
    Flum, J
    Grohe, M
    SIAM JOURNAL ON COMPUTING, 2001, 31 (01) : 113 - 145
  • [48] On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
    Olyaei, Meysam Rajaati Bavil
    Hooshmandasl, Mohammad Reza
    Dinneen, Michael J.
    Shakiba, Ali
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (02):
  • [49] Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
    D'Emidio, Mattia
    Forlizzi, Luca
    Frigioni, Daniele
    Leucci, Stefano
    Proietti, Guido
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (01) : 165 - 184
  • [50] Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem
    Sutton, Andrew M.
    ALGORITHMICA, 2021, 83 (04) : 1138 - 1163
12345