Pages that link to "Item:Q4327821"
From MaRDI portal
The following pages link to Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821):
Displaying 50 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Ordered coloring of grids and related graphs (Q442258) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Flow metrics (Q596135) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Minimizing elimination tree height can increase fill more than linearly (Q671941) (← links)
- Connected graph searching (Q690489) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Polynomial expansion and sublinear separators (Q1686248) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Arankings of trees (Q1717194) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- On the tree-depth and tree-width in heterogeneous random graphs (Q2102520) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
