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 条
  • [31] Linear-time counting algorithms for independent sets in chordal graphs
    Okamoto, Y
    Uno, T
    Uehara, R
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 433 - 444
  • [32] LABELING ALGORITHMS FOR DOMINATION PROBLEMS IN SUN-FREE CHORDAL GRAPHS
    CHANG, GJ
    DISCRETE APPLIED MATHEMATICS, 1988, 22 (01) : 21 - 34
  • [33] Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
    McKee, TA
    DISCRETE MATHEMATICS, 2003, 260 (1-3) : 231 - 238
  • [34] Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
    Uehara, R
    Toda, S
    Nagoya, T
    DISCRETE APPLIED MATHEMATICS, 2005, 145 (03) : 479 - 482
  • [35] On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
    de Figueiredo, C. M. H.
    Faria, L.
    Klein, S.
    Sritharan, R.
    THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 57 - 67
  • [36] Faster algorithms for quantitative verification in bounded treewidth graphs
    Krishnendu Chatterjee
    Rasmus Ibsen-Jensen
    Andreas Pavlogiannis
    Formal Methods in System Design, 2021, 57 : 401 - 428
  • [37] Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
    Chatterjee, Krishnendu
    Ibsen-Jensen, Rasmus
    Pavlogiannis, Andreas
    COMPUTER AIDED VERIFICATION, PT I, 2015, 9206 : 140 - 157
  • [38] FASTER ALGORITHMS FOR MINIMUM CYCLE BASIS IN DIRECTED GRAPHS
    Hariharan, Ramesh
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    SIAM JOURNAL ON COMPUTING, 2008, 38 (04) : 1430 - 1447
  • [39] Faster shortest-path algorithms for planar graphs
    Henzinger, MR
    Klein, P
    Rao, S
    Subramanian, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) : 3 - 23
  • [40] Faster algorithms for quantitative verification in bounded treewidth graphs
    Chatterjee, Krishnendu
    Ibsen-Jensen, Rasmus
    Pavlogiannis, Andreas
    FORMAL METHODS IN SYSTEM DESIGN, 2021, 57 (03) : 401 - 428
12345