Pages that link to "Item:Q3631902"
From MaRDI portal
The following pages link to Exact Algorithms for Treewidth and Minimum Fill-In (Q3631902):
Displaying 34 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Computing hypergraph width measures exactly (Q437685) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← 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 complexity of computing treelength (Q972342) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← 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)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- Constructing Brambles (Q3182927) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
- (Q5111890) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- (Q5743514) (← links)
- Tangle bases: Revisited (Q6087071) (← 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)
