A LINEAR ALGORITHM FOR THE DOMINATION NUMBER OF A SERIES-PARALLEL GRAPH

被引：53
|
作者：
KIKUNO, T
YOSHIDA, N
KAKUDA, Y
机构：
来源：
DISCRETE APPLIED MATHEMATICS | 1983年 / 5卷 / 03期
关键词：
D O I：
10.1016/0166-218X(83)90003-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：299 / 311
页数：13
相关论文
共 50 条
  • [21] On mixed linear layouts of series-parallel graphs
    Angelini, Patrizio
    Bekos, Michael A.
    Kindermann, Philipp
    Mchedlidze, Tamara
    THEORETICAL COMPUTER SCIENCE, 2022, 936 : 129 - 138
  • [22] Minimum Linear Arrangement of Series-Parallel Graphs
    Eikel, Martina
    Scheideler, Christian
    Setzer, Alexander
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 168 - 180
  • [23] On spanning trees with restricted degrees for series-parallel graph
    Siddiqi, MEH
    Haque, ME
    Shahin, M
    Hossan, MB
    2005 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2005, : 256 - 258
  • [24] Recognizing Series-Parallel Matrices in Linear Time
    Walter, Matthias
    INFORMS JOURNAL ON COMPUTING, 2023, 35 (06) : 1404 - 1418
  • [25] On the feedback vertex set polytope of a series-parallel graph
    Fiorini, Samuel
    Marcotte, Odile
    DISCRETE OPTIMIZATION, 2009, 6 (03) : 271 - 287
  • [26] Optimisation of the number of IGBT devices in a series-parallel string
    Shammas, Noel Y. A.
    Withanage, Ruchira
    Chamund, Dinesh
    MICROELECTRONICS JOURNAL, 2008, 39 (06) : 899 - 907
  • [27] A New Formula for the Number of Labeled Series-Parallel Graphs
    Voblyi V.A.
    Journal of Mathematical Sciences, 2023, 277 (5) : 718 - 721
  • [28] On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs
    de Mier, Anna
    Noy, Marc
    GRAPHS AND COMBINATORICS, 2012, 28 (02) : 265 - 275
  • [29] Refinement of the Asymptotics of the Number of Labeled Series-Parallel Graphs
    Voblyi, V. A.
    MATHEMATICAL NOTES, 2021, 109 (5-6) : 986 - 989
  • [30] The strong fractional choice number of series-parallel graphs
    Li, Xuer
    Zhu, Xuding
    DISCRETE MATHEMATICS, 2020, 343 (05)
12345