Pages that link to "Item:Q4327821"
From MaRDI portal
The following pages link to Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821):
Displayed 43 items.
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- On the tree-depth of random graphs (Q2442213) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) (← links)
- Edge ranking of weighted trees (Q2495900) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (Q2835842) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- (Q4638063) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- (Q5009556) (← links)
- (Q5089157) (← links)
- (Q5090422) (← links)
- (Q5136270) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963) (← links)
- Circumference and Pathwidth of Highly Connected Graphs (Q5265331) (← links)
- On Universal Graphs of Minor Closed Families (Q5300987) (← links)
- (Q5497123) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- (Q5874487) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6039418) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- A \(p\)-centered coloring for the grid using \(O(p)\) colors (Q6080129) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Induced subgraphs and path decompositions (Q6162145) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- A strengthening and an efficient implementation of Alon-Tarsi list coloring method (Q6197808) (← links)