scientific article; zbMATH DE number 1107728
From MaRDI portal
Publication:4373676
zbMATH Open0886.05103MaRDI QIDQ4373676FDOQ4373676
Authors: Elias Dahlhaus 
Publication date: 8 April 1998
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4152428
- Minimal elimination ordering for graphs of bounded degree
- scientific article; zbMATH DE number 1282792
- Some aspects of perfect elimination orderings in chordal graphs
- Generating and characterizing the perfect elimination orderings of a chordal graph
- scientific article; zbMATH DE number 1145349
- Perfect elimination orderings of chordal powers of graphs
- Minimum linear arrangement of chord graphs
- scientific article; zbMATH DE number 1302027
- Enumerating minimal dominating sets in chordal graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (18)
- Minimal elimination ordering for graphs of bounded degree
- Lex M versus MCS-M
- Title not available (Why is that?)
- Tree decomposition and discrete optimization problems: a survey
- A vertex incremental approach for maintaining chordality
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Minimal triangulations of graphs: a survey
- A practical algorithm for making filled graphs minimal
- Treewidth computations. I: Upper bounds
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Efficiently enumerating minimal triangulations
- On the structure of linear programs with overlapping cardinality constraints
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Minimal elimination of planar graphs
- Title not available (Why is that?)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373676)
