Pages that link to "Item:Q3751592"
From MaRDI portal
The following pages link to Graph minors. II. Algorithmic aspects of tree-width (Q3751592):
Displayed 50 items.
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Girth and treewidth (Q707020) (← links)
- Graph minors. III. Planar tree-width (Q799684) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- The treewidth and pathwidth of hypercubes (Q819827) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Combinatorics of TCP reordering (Q857780) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- Introduction to special issue on RNA (Q938102) (← links)
- Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition (Q938119) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)