THE GENERAL MINIMUM FILL-IN PROBLEM

被引：0
|
作者：
WENDEL, H
机构：
来源：
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1987年 / 8卷 / 04期
关键词：
D O I：
10.1137/0608059
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：710 / 745
页数：36
相关论文
共 50 条
  • [1] MINIMUM FILL-IN PROBLEM OF GRAPHS
    YUAN Jinjiang (Department of Mathematics
    SystemsScienceandMathematicalSciences, 1996, (03) : 193 - 197
  • [2] A polynomial approximation algorithm for the minimum fill-in problem
    Natanzon, A
    Shamir, R
    Sharan, R
    SIAM JOURNAL ON COMPUTING, 2000, 30 (04) : 1067 - 1079
  • [3] Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm
    Komiyama, Tomoko
    Suzuki, Tomohiro
    IEEE ACCESS, 2023, 11 : 114424 - 114431
  • [4] Faster Parameterized Algorithms for Minimum Fill-in
    Hans L. Bodlaender
    Pinar Heggernes
    Yngve Villanger
    Algorithmica, 2011, 61 : 817 - 838
  • [5] SUBEXPONENTIAL PARAMETERIZED ALGORITHM FOR MINIMUM FILL-IN
    Fomin, Fedor V.
    Villanger, Yngve
    SIAM JOURNAL ON COMPUTING, 2013, 42 (06) : 2197 - 2216
  • [6] Exact algorithms for treewidth and minimum fill-in
    Fomin, Fedor V.
    Kratsch, Dieter
    Todinca, Ioan
    Villanger, Yngve
    SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 1058 - 1079
  • [7] The Minimum Fill-in for the Corona of Two Graphs
    Jin Zhiyong
    Li Wenquan(Henan University. Kaifeng
    数学季刊, 1996, (01) : 107 - 110
  • [8] Faster Parameterized Algorithms for MINIMUM FILL-IN
    Bodlaender, Hans L.
    Heggernes, Pinar
    Villanger, Yngve
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 282 - +
  • [9] Faster Parameterized Algorithms for Minimum Fill-in
    Bodlaender, Hans L.
    Heggernes, Pinar
    Villanger, Yngve
    ALGORITHMICA, 2011, 61 (04) : 817 - 838
  • [10] Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
    Fedor V. Fomin
    Geevarghese Philip
    Yngve Villanger
    Algorithmica, 2015, 71 : 1 - 20
12345