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.
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- Rooted routing in the plane (Q1346696) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Minimum self-repairing graphs (Q1376072) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- Branch-width and Rota's conjecture (Q1403924) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Querying linguistic treebanks with monadic second-order logic in linear time (Q1770837) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- On matroids of branch-width three. (Q1850629) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Fork-decompositions of matroids (Q1883405) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
- Trimming of graphs, with application to point labeling (Q1959389) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- Contiguous search problem in Sierpiński graphs (Q2272196) (← links)