Pages that link to "Item:Q1132111"

The following pages link to The directed subgraph homeomorphism problem (Q1132111):

Displaying 50 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• Computing strictly-second shortest paths (Q287170) (← links)
• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
• On the hardness of network design for bottleneck routing games (Q389953) (← links)
• Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
• Finding and fixing faults (Q414907) (← links)
• On making directed graphs transitive (Q414917) (← links)
• On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
• On shortest disjoint paths in planar graphs (Q429668) (← links)
• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
• Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
• Edge-disjoint paths in digraphs with bounded independence number (Q473097) (← links)
• Criticality for multicommodity flows (Q473104) (← links)
• Finding a subdivision of a digraph (Q476873) (← links)
• Disjoint paths in tournaments (Q481696) (← links)
• Network topology and equilibrium existence in weighted network congestion games (Q495752) (← links)
• Forbidden directed minors and Kelly-width (Q501668) (← links)
• Network characterizations for excluding Braess's paradox (Q506543) (← links)
• The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
• Disjoint cycles in digraphs (Q595675) (← links)
• Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' (Q611943) (← links)
• Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments (Q635308) (← links)
• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
• Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
• Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
• Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
• Multiflows in symmetric digraphs (Q713317) (← links)
• Exact localisations of feedback sets (Q722200) (← links)
• Tournament pathwidth and topological containment (Q744161) (← links)
• Tournament immersion and cutwidth (Q765193) (← links)
• On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes (Q783034) (← links)
• Signsolvability revisited (Q795898) (← links)
• Chordless paths through three vertices (Q820149) (← links)
• On parameterized complexity of liquid democracy (Q831697) (← links)
• Finding disjoint paths with related path costs (Q857785) (← links)
• Expressiveness and complexity of graph logic (Q870359) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• Are there any good digraph width measures? (Q896003) (← links)
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
• The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
• Synthesizing bounded-time 2-phase fault recovery (Q903518) (← links)
• A simple solution to the two paths problem in planar graphs (Q917331) (← links)
• The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
• Links in edge-colored graphs (Q966157) (← links)
• Induced disjoint paths problem in a planar digraph (Q967379) (← links)
• Disjoint paths in symmetric digraphs (Q1003758) (← links)
• A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
• Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)