Pages that link to "Item:Q5249047"
From MaRDI portal
The following pages link to GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH (Q5249047):
Displaying 34 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Listing all the minimal separators of a 3-connected planar graph (Q819830) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- Graphical models for genetic analyses (Q1764318) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Observability-blocking control using sparser and regional feedback for network synchronization processes (Q2097741) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Conditions for swappability of records in a microdata set when some marginals are fixed (Q2271706) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- A local approach to concept generation (Q2385441) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Minimal separators in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-tidy graphs (Q2840517) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5000291) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- (Q6089669) (← links)
- (Q6089678) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
- On the hardness of inclusion-wise minimal separators enumeration (Q6195343) (← links)
