Hypergraphs with polynomial representation: introducing r-splits
From MaRDI portal
(Redirected from Publication:6599817)
Hypergraphs with polynomial representation: introducing \(r\)-splits
Hypergraphs with polynomial representation: introducing \(r\)-splits
Recommendations
Cites work
- A Combinatorial Decomposition Theory
- A survey of the algorithmic aspects of modular decomposition
- Approximating clique-width and branch-width
- Decomposition of Directed Graphs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Graph minors. II. Algorithmic aspects of tree-width
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- Linear time split decomposition revisited
- Rank-width and vertex-minors
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Tree-representation of set families and applications to combinatorial decompositions
- Twin-width. I: Tractable FO model checking
This page was built for publication: Hypergraphs with polynomial representation: introducing \(r\)-splits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599817)