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 条

[31] On treewidth and minimum fill-in of asteroidal triple-free graphs
Kloks, T
Kratsch, D
Spinrad, J
THEORETICAL COMPUTER SCIENCE, 1997, 175 (02) : 309 - 335
[32] Computing treewidth and minimum fill-in for permutation graphs in linear time
Meister, D
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 91 - 102
[33] A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Broersma, HJ
Dahlhaus, E
Kloks, T
DISCRETE APPLIED MATHEMATICS, 2000, 99 (1-3) : 367 - 400
[34] Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
Bliznets, Ivan
Cygan, Marek
Komosa, Pawel
Pilipczuk, Michal
Mach, Lukas
ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
[35] SPARSE VECTOR METHOD IMPROVEMENTS VIA MINIMUM INVERSE FILL-IN ORDERING
LEE, CL
CHEN, NM
IEEE TRANSACTIONS ON POWER SYSTEMS, 1993, 8 (01) : 239 - 245
[36] FILL-IN AND OPERATIONS OF GRAPHS
JUAN, JJ
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES, 1995, 38 (07): : 777 - 788
[37] Fill-in and operations of graphs
原晋江
Science China Mathematics, 1995, (07) : 777 - 788
[38] Searching for better fill-in
Fomin, Fedor V.
Villanger, Yngve
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (07) : 1374 - 1383
[39] Minimum fill-in and treewidth of split plus ke and split plus kv graphs
Mancini, Federico
ALGORITHMS AND COMPUTATION, 2007, 4835 : 881 - 892
[40] Minimum fill-in and treewidth of split plus ke and split plus kv graphs
Mancini, Federico
DISCRETE APPLIED MATHEMATICS, 2010, 158 (07) : 747 - 754

← 1 2 3 4 5 →