Pages that link to "Item:Q5466494"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466494):
Displayed 16 items.
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Learning tractable Bayesian networks in the space of elimination orders (Q2321308) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Tangle bases: Revisited (Q6087071) (← links)