Pages that link to "Item:Q5248997"
From MaRDI portal
The following pages link to PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997):
Displayed 12 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Minimal proper interval completions (Q963366) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Partition refinement of component interaction automata (Q1951613) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)