scientific article; zbMATH DE number 1354123
From MaRDI portal
Publication:4268436
zbMath0925.05063MaRDI QIDQ4268436
Publication date: 31 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Treewidth of the generalized Kneser graphs, Treewidth of the \(q\)-Kneser graphs, Most probable explanations in Bayesian networks: complexity and tractability, Chordal embeddings of planar graphs, A simple linear-time algorithm for finding path-decompositions of small width, How to use the minimal separators of a graph for its chordal triangulation, The isomorphism problem for \(k\)-trees is complete for logspace, Distributed interactive proofs for the recognition of some geometric intersection graph classes