Results 21 to 30 of about 2,126 (197)
Surfaces, Tree-Width, Clique-Minors, and Partitions
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Guoli +3 more
openaire +1 more source
On finding minimum-diameter clique trees [PDF]
, 1991 It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it is interesting to consider which one is most desirable under various circumstances.
Blair +6 more
openaire +2 more sources
Automated Parallel Test Forms Assembly using Zero-suppressed Binary Decision Diagrams
IEEE Access, 2023 Recently, through the progress achieved in the study of computer science, automated test assemblies of parallel test forms, for which each form has equivalent measurement accuracy but with a different set of items, have emerged as a new standard tool. An
Kazuma Fuchimoto +2 more
doaj +1 more source
Algorithms, 2018 Wu et al. (2014) showed that under the small set expansion hypothesis (SSEH) there is no polynomial time approximation algorithm with any constant approximation factor for several graph width parameters, including tree-width, path-width, and cut-width ...
Koichi Yamazaki
doaj +1 more source
Clique Trees of Infinite Locally Finite Chordal Graphs
The Electronic Journal of Combinatorics, 2018 We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are in bijection with the edges of the corresponding collection of finite trees.
Lehner, Florian, Temmel, C.
openaire +4 more sources
Linear rank-width and linear clique-width of trees [PDF]
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adler, Isolde, Kanté, Mamadou Moustapha
openaire +5 more sources
Deciding Clique-Width for Graphs of Bounded Tree-Width [PDF]
Journal of Graph Algorithms and Applications, 2001 Summary: We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width \(k\) for some fixed integer \(k\).
Espelage, Wolfgang +2 more
openaire +2 more sources
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
Моделирование и анализ информационных систем, 2020 In this paper, we consider the notion of a direct type algorithm introduced by V. A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties.
Aleksandr N. Maksimenko
doaj +1 more source
Clique-sums, tree-decompositions and compactness
Discrete Mathematics, 1990 The results presented in this paper seem to be in the line with previous papers of Robertson and Seymour. Five definitions fix basic ideas related with tree decompositions, cliques, \(k\)-simplexes, \(k\)-complexes and chordal graphs as well as \(k\)-summability and other related subjects.
Kříž, Igor, Thomas, Robin
openaire +1 more source
1-Skeletons of the Spanning Tree Problems with Additional Constraints
Моделирование и анализ информационных систем, 2015 In this paper, we study polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less than ...
V. A. Bondarenko +2 more
doaj +1 more source