Pages that link to "Item:Q1892832"
From MaRDI portal
The following pages link to Graph minors. XIII: The disjoint paths problem (Q1892832):
Displaying 50 items.
- Min-sum 2-paths problems (Q260263) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Excluded-minor characterization of apex-outerplanar graphs (Q292261) (← links)
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Bounded face-width forces \(K_7\)-minors in orientable surfaces (Q322276) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Graph minors. XXII. Irrelevant vertices in linkage problems (Q412177) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Detecting an induced net subdivision (Q461729) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Edge-disjoint paths in digraphs with bounded independence number (Q473097) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Disjoint paths in tournaments (Q481696) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
