Faster dynamic algorithms for chordal graphs, and an application to phylogeny

被引：0
|
作者：
Berry, A
Sigayret, A
Spinrad, J
机构：
[1] LIMOS, UMR, F-63173 Aubiere, France
[2] Vanderbilt Univ, Dept EECS, Nashville, TN 37235 USA
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2005年 / 3787卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
引用
收藏
页码：445 / 455
页数：11
相关论文
共 50 条
  • [21] Faster Parameterized Algorithms for Deletion to Split Graphs
    Ghosh, Esha
    Kolay, Sudeshna
    Kumar, Mrinal
    Misra, Pranabendu
    Panolan, Fahad
    Rai, Ashutosh
    Ramanujan, M. S.
    ALGORITHMICA, 2015, 71 (04) : 989 - 1006
  • [22] Faster Parameterized Algorithms for Deletion to Split Graphs
    Esha Ghosh
    Sudeshna Kolay
    Mrinal Kumar
    Pranabendu Misra
    Fahad Panolan
    Ashutosh Rai
    M. S. Ramanujan
    Algorithmica, 2015, 71 : 989 - 1006
  • [23] Faster algorithms for counting subgraphs in sparse graphs
    Marco Bressan
    Algorithmica, 2021, 83 : 2578 - 2605
  • [24] Chordal Graphs
    Arneson, Broderick
    Rudnicki, Piotr
    FORMALIZED MATHEMATICS, 2006, 14 (03): : 79 - 92
  • [25] Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
    Marthe Bonamy
    Matthew Johnson
    Ioannis Lignos
    Viresh Patel
    Daniël Paulusma
    Journal of Combinatorial Optimization, 2014, 27 : 132 - 143
  • [26] Chordal multipartite graphs and chordal colorings
    McKee, Terry A.
    DISCRETE MATHEMATICS, 2007, 307 (17-18) : 2309 - 2314
  • [27] Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
    Bonamy, Marthe
    Johnson, Matthew
    Lignos, Ioannis
    Patel, Viresh
    Paulusma, Daniel
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 132 - 143
  • [28] Chordal graphs and their clique graphs
    Galinier, P
    Habib, M
    Paul, C
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 358 - 371
  • [29] Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
    Chang, MS
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 146 - 155
  • [30] Hardness and algorithms of equitable tree-coloring problem in chordal graphs
    Niu, Bei
    Li, Bi
    Zhang, Xin
    THEORETICAL COMPUTER SCIENCE, 2021, 857 : 8 - 15
12345