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.
- 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)
- 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)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- On tree-partition-width (Q1024321) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- Graph minors. I. Excluding a forest (Q1055450) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- Grids and their minors (Q1097897) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Decomposing infinite graphs (Q1191914) (← links)