A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
From MaRDI portal
Recommendations
Cited in
(39)- scientific article; zbMATH DE number 867679 (Why is no real title available?)
- Feedback arc set in bipartite tournaments is NP-complete
- Design and serial construction of digraph braids
- DAG-width and circumference of digraphs
- Algorithms for finding maximum transitive subtournaments
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Safe sets and in-dominating sets in digraphs
- Quasi-transitive digraphs and their extensions
- Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- scientific article; zbMATH DE number 4085689 (Why is no real title available?)
- Edge-arc-disjoint paths in semicomplete mixed graphs
- A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
- Cycles through \(k\) vertices in bipartite tournaments
- On the structure of locally semicomplete digraphs
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
- On width measures and topological problems on semi-complete digraphs
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Disjoint paths in decomposable digraphs
- scientific article; zbMATH DE number 7232797 (Why is no real title available?)
- Strong arc decompositions of split digraphs
- Hardness of fully dense problems
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
- Disjoint paths in tournaments
- Tournaments and Semicomplete Digraphs
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- NC algorithms for antidirected hamiltonian paths and cycles in tournaments
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- On \(k\)-strong and \(k\)-cyclic digraphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- Component order connectivity in directed graphs
- Component order connectivity in directed graphs
- Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
- Disjoint paths in unions of tournaments
This page was built for publication: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018846)
