The directed subgraph homeomorphism problem
From MaRDI portal
Cites work
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Flow Graph Reducibility
- scientific article; zbMATH DE number 3569814 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- On the Complexity of Timetable and Multicommodity Flow Problems
- The subgraph homeomorphism problem
Cited in
(only showing first 100 items - show all)- Disjoint paths in symmetric digraphs
- A minimization version of a directed subgraph homeomorphism problem
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Structure and recognition of graphs with no 6-wheel subdivision
- Disjoint directed and undirected paths and cycles in digraphs
- The 2-linkage problem for acyclic digraphs
- The complexity of counting homeomorphs
- An approach to the subgraph homeomorphism problem
- Sign-nonsingular matrices and even cycles in directed graphs
- Even cycles in directed graphs
- Characterization of even directed graphs
- On digraphs with no two disjoint directed cycles
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- On orientations and shortest paths
- The subgraph homeomorphism problem
- Disjoint paths in graphs
- 2-linked graphs
- Symmetric space-bounded computation
- Directed circuits on a torus
- Highly connected non-2-linked digraphs
- Detecting cycles through three fixed vertices in a graph
- On the structure of locally semicomplete digraphs
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Cycles through \(k\) vertices in bipartite tournaments
- The complexity of induced minors and related problems
- MNP: A class of NP optimization problems
- Packing directed circuits
- Bounded arity Datalog () queries on graphs
- The disjoint shortest paths problem
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Congestion games with mixed objectives
- Inefficiencies in network models: a graph-theoretic perspective
- Disjoint paths in unions of tournaments
- Protection of flows under targeted attacks
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Finding supported paths in heterogeneous networks
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Special cases of the quadratic shortest path problem
- Finding read-once resolution refutations in systems of 2CNF clauses
- Robust flows over time: models and complexity results
- Cycles and paths in bipartite tournaments with spanning configurations
- Hereditarily hard \(H\)-colouring problems
- Alternating paths in edge-colored complete graphs
- Directed tree-width
- Minimum k arborescences with bandwidth constraints
- The complexity of minimal satisfiability problems
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
- Finding temporal paths under waiting time constraints
- On the approximability of robust network design
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
- On the complexity of algorithms for detecting \(k\)-length negative cost cycles
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Safety in s-t paths, trails and walks
- Polynomial time algorithms for tracking path problems
- On packing time-respecting arborescences
- On the edge capacitated Steiner tree problem
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms
- Edge-disjoint branchings in temporal digraphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Routing with congestion in acyclic digraphs
- Achieving target equilibria in network routing games without knowing the latency functions
- Two disjoint shortest paths problem with non-negative edge length
- The undirected two disjoint shortest paths problem
- The complexity of computing a robust flow
- The directed 2-linkage problem with length constraints
- On width measures and topological problems on semi-complete digraphs
- Backdoors to tractable answer set programming
- The complexity of multi-mean-payoff and multi-energy games
- Hardness and approximation results for packing Steiner trees
- Paths and trails in edge-colored graphs
- Free multiflows in bidirected and skew-symmetric graphs
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Simple undirected two-commodity integral flow with a unitary demand
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path
- On the problem of finding disjoint cycles and dicycles in a digraph
- (Arc-)disjoint flows in networks
- Digraph width measures in parameterized algorithmics
- Cost-based filtering for shorter path constraints
- How much can taxes help selfish routing?
- Meet and merge: approximation algorithms for confluent flows
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Disjoint paths in graphs. (Reprint)
- Ordered optimal solutions and parametric minimum cut problems
- The maximum integer multiterminal flow problem in directed graphs
- Packing arc-disjoint cycles in tournaments
- Algorithms for finding disjoint path covers in unit interval graphs
- On the parameterized complexity of the connected flow and many visits TSP problem
- Linearizable special cases of the quadratic shortest path problem
- Graph planning with expected finite horizon
- A tight lower bound for edge-disjoint paths on planar DAGs
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
- DAG-width and circumference of digraphs
- Complexity of a classical flow restoration problem
- Theoretical and computational advances for network diversion
This page was built for publication: The directed subgraph homeomorphism problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132111)
