On the public citation graph

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-52292-1_16openalex-snapshot
On feedback problems in digraphs
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01275674openalex-snapshot
Highly connected non-2-linked digraphs
inferredcites →https://doi.org/10.1007/bf02579210openalex-snapshot
On digraphs with no two disjoint directed cycles
inferredcites →https://doi.org/10.1016/0095-8956(91)90002-2openalex-snapshot
Edge-disjoint in- and out-branchings in tournaments and related path problems
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/s0012-365x(85)80022-4openalex-snapshot
The 2-linkage problem for acyclic digraphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70447-3openalex-snapshot
On the 2-Linkage Problem for Semicomplete Digraphs
inferredcites →https://doi.org/10.1137/0403046openalex-snapshot
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199808)28:4<171::aid-jgt1>3.0.co;2-gopenalex-snapshot
Generalizations of tournaments: A survey
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199810)29:2<111::aid-jgt7>3.0.co;2-uopenalex-snapshot
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
inferred← citeshttps://doi.org/10.1002/jgt.21775openalex-snapshot
Arc-Disjoint Paths in Decomposable Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.21830openalex-snapshot
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
inferred← citeshttps://doi.org/10.1002/jgt.21894openalex-snapshot
DAG‐Width and Circumference of Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.22090openalex-snapshot
Disjoint Paths in Decomposable Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.23199openalex-snapshot
Edge‐arc‐disjoint paths in semicomplete mixed graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190190405openalex-snapshot
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
inferred← citeshttps://doi.org/10.1006/jagm.1999.1041openalex-snapshot
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_63openalex-snapshot
NC algorithms for antidirected hamiltonian paths and cycles in tournaments
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_2openalex-snapshot
Tournaments and Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_8openalex-snapshot
Quasi-Transitive Digraphs and Their Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_35openalex-snapshot
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_75openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1007/bf01215353openalex-snapshot
Cycles throughk vertices in bipartite tournaments
inferred← citeshttps://doi.org/10.1007/s00224-013-9453-4openalex-snapshot
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
inferred← citeshttps://doi.org/10.1007/s00453-015-0038-2openalex-snapshot
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments
inferred← citeshttps://doi.org/10.1007/s00453-022-01004-zopenalex-snapshot
Component Order Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01093-wopenalex-snapshot
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
inferred← citeshttps://doi.org/10.1007/s13676-016-0098-8openalex-snapshot
New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90645-vopenalex-snapshot
On the structure of locally semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00272-xopenalex-snapshot
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00300-lopenalex-snapshot
On k-strong and k-cyclic digraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90002-2openalex-snapshot
Edge-disjoint in- and out-branchings in tournaments and related path problems
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90008-zopenalex-snapshot
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50002-6openalex-snapshot
10.1016/b978-044488002-4/50002-6
inferred← citeshttps://doi.org/10.1016/j.aim.2014.11.011openalex-snapshot
Disjoint paths in tournaments
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.003openalex-snapshot
Quasi-hamiltonian paths in semicomplete multipartite digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.012openalex-snapshot
Safe sets and in-dominating sets in digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.016openalex-snapshot
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2007.02.006openalex-snapshot
Hardness of fully dense problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.11.016openalex-snapshot
Feedback arc set in bipartite tournaments is NP-complete
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.08.007openalex-snapshot
Disjoint paths in unions of tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.01.006openalex-snapshot
On width measures and topological problems on semi-complete digraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00194-0openalex-snapshot
Linkages in locally semicomplete digraphs and quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00064-5openalex-snapshot
On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
inferred← citeshttps://doi.org/10.1017/s0963548306007887openalex-snapshot
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
inferred← citeshttps://doi.org/10.1080/17513472.2015.1007410openalex-snapshot
Design and serial construction of digraph braids
inferred← citeshttps://doi.org/10.1093/comjnl/bxm039openalex-snapshot
Some Parameterized Problems On Digraphs
inferred← citeshttps://doi.org/10.1112/plms/pdu019openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1137/050623905openalex-snapshot
Ranking Tournaments
inferred← citeshttps://doi.org/10.1137/1.9781611973105.29openalex-snapshot
Jungles, bundles, and fixed-parameter tractability
inferred← citeshttps://doi.org/10.1145/1060590.1060692openalex-snapshot
Aggregating inconsistent information
inferred← citeshttps://doi.org/10.1145/1109557.1109642openalex-snapshot
Ordering by weighted number of wins gives a good ranking for weighted tournaments
inferred← citeshttps://doi.org/10.1145/1411509.1411513openalex-snapshot
Aggregating inconsistent information
inferred← citeshttps://doi.org/10.46298/dmtcs.7437openalex-snapshot
On the Boolean dimension of a graph and other related parameters
inferred← citeshttps://doi.org/10.46298/dmtcs.7474openalex-snapshot
On the inversion number of oriented graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6226openalex-snapshot
Disjoint paths in tournaments
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06664openalex-snapshot
Safe sets in digraphs
inferred← citeshttps://doi.org/10.5555/1109557.1109642openalex-snapshot
Ordering by weighted number of wins gives a good ranking for weighted tournaments
inferred← citeshttps://doi.org/10.5555/2627817.2627846openalex-snapshot
Jungles, bundles, and fixed-parameter tractability
inferred← citeshttps://doi.org/10.70675/733cbd10z5feaz4101z9064z62ba9a7dac01openalex-snapshot
Algorithmic and structural results on directed cycles in dense digraphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.