Pages that link to "Item:Q1605302"
From MaRDI portal
The following pages link to Listing all potential maximal cliques of a graph (Q1605302):
Displaying 39 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- On probe permutation graphs (Q967305) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← 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)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← 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)
- Constructing Brambles (Q3182927) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Experimental Analysis of Treewidth (Q5042459) (← links)
- (Q5743514) (← links)
- On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894) (← links)
- (Q6089669) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On the hardness of inclusion-wise minimal separators enumeration (Q6195343) (← links)
