Pages that link to "Item:Q3113765"
From MaRDI portal
The following pages link to Finding Induced Subgraphs via Minimal Triangulations (Q3113765):
Displaying 35 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Computing hypergraph width measures exactly (Q437685) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← 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)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
