scientific article; zbMATH DE number 1420906
From MaRDI portal
zbMATH Open0943.05077MaRDI QIDQ4944975FDOQ4944975
Authors: Konstantin Skodinis 
Publication date: 7 June 2000
Full work available at URL: https://eudml.org/doc/120594
Title of this publication is not available (Why is that?)
Recommendations
Cited In (16)
- On the size of minimal separators for treedepth decomposition
- On the number of minimal separators in graphs
- Treewidth versus clique number. II: Tree-independence number
- An introduction to clique minimal separator decomposition
- On the maximum weight minimal separator
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- Efficient enumeration of all minimal separators in a graph
- Graphs with polynomially many minimal separators
- Tree decompositions with small cost
- Tree Decompositions with Small Cost
- On the maximum weight minimal separator
- Taming graphs with no large creatures and skinny ladders
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- On the number of minimal separators in 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 Q4944975)
