Pages that link to "Item:Q1132111"
From MaRDI portal
The following pages link to The directed subgraph homeomorphism problem (Q1132111):
Displayed 50 items.
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Signsolvability revisited (Q795898) (← links)
- Chordless paths through three vertices (Q820149) (← 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)
- 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)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- The complexity of counting homeomorphs (Q1058852) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Sign-nonsingular matrices and even cycles in directed graphs (Q1073811) (← links)
- Even cycles in directed graphs (Q1084409) (← links)
- Characterization of even directed graphs (Q1085177) (← links)
- On digraphs with no two disjoint directed cycles (Q1092919) (← links)
- Edge-disjoint in- and out-branchings in tournaments and related path problems (Q1112061) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- Disjoint paths in graphs (Q1150632) (← links)
- 2-linked graphs (Q1150633) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- Directed circuits on a torus (Q1180428) (← links)
- Highly connected non-2-linked digraphs (Q1181017) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- On the structure of locally semicomplete digraphs (Q1198647) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem (Q1272469) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- Cycles through \(k\) vertices in bipartite tournaments (Q1330800) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- Packing directed circuits (Q1375699) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- The disjoint shortest paths problem (Q1392552) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- Cycles and paths in bipartite tournaments with spanning configurations (Q1823256) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Alternating paths in edge-colored complete graphs (Q1842658) (← links)
- Directed tree-width (Q1850539) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- Cost-based filtering for shorter path constraints (Q2454811) (← links)