scientific article; zbMATH DE number 751126
From MaRDI portal
Publication:4764622
zbMath0819.68085MaRDI QIDQ4764622
Jean R. S. Blair, Barry W. Peyton
Publication date: 4 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
End simplicial vertices in path graphs, Tree-decompositions with bags of small diameter, Finding minimum height elimination trees for interval graphs in polynomial time, A clique tree algorithm for partitioning a chordal graph into transitive subgraphs, Minimum Average Distance Clique Trees, Subgraph trees in graph theory, Moplex orderings generated by the LexDFs algorithm, Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs, Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
