scientific article; zbMATH DE number 1305489
From MaRDI portal
Publication:4252378
zbMath0938.68074MaRDI QIDQ4252378
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (17)
Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Minimal fill in O(\(n^{2.69}\)) time ⋮ Lex M versus MCS-M ⋮ Representing a concept lattice by a graph ⋮ Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Two characterisations of the minimal triangulations of permutation graphs ⋮ Computing and listing avoidable vertices and paths ⋮ Generating weakly chordal graphs from arbitrary graphs ⋮ Computing and listing avoidable vertices and paths ⋮ Treewidth computations. I: Upper bounds ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ A note on minimal d-separation trees for structural learning ⋮ Maximal sub-triangulation in pre-processing phylogenetic data ⋮ Algorithms for unipolar and generalized split graphs ⋮ Unnamed Item ⋮ Hybrid backtracking bounded by tree-decomposition of constraint networks
This page was built for publication:
