Pages that link to "Item:Q1274912"
From MaRDI portal
The following pages link to A partial k-arboretum of graphs with bounded treewidth (Q1274912):
Displaying 50 items.
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- Computing bond orders in molecule graphs (Q631782) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← 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)
- The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Safe separators for treewidth (Q819825) (← links)
- The treewidth and pathwidth of hypercubes (Q819827) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Independence polynomials of \(k\)-tree related graphs (Q972329) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
