On the public citation graph

Finding Disjoint Paths on Directed Acyclic Graphs

https://doi.org/10.1007/11604686_28
0 signed · 27 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.1002/net.3230140209openalex-snapshot
A quick method for finding shortest pairs of disjoint paths
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/3-540-10704-5openalex-snapshot
Graph Theory and Algorithms
inferredcites →https://doi.org/10.1007/3-540-10704-5_18openalex-snapshot
The two disjoint path problem and wire routing design
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_31openalex-snapshot
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
inferredcites →https://doi.org/10.1007/pl00009195openalex-snapshot
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line
inferredcites →https://doi.org/10.1007/pl00009264openalex-snapshot
Output-Sensitive Reporting of Disjoint Paths
inferredcites →https://doi.org/10.1016/0012-365x(80)90158-2openalex-snapshot
Disjoint paths in graphs
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/j.disc.2006.03.019openalex-snapshot
Disjoint paths in graphs
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/s0195-6698(80)80039-4openalex-snapshot
2-Linked Graphs
inferredcites →https://doi.org/10.1142/s0129054100000247openalex-snapshot
AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
inferredcites →https://doi.org/10.1145/322047.322048openalex-snapshot
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
inferredcites →https://doi.org/10.1145/322203.322207openalex-snapshot
A Polynomial Solution to the Undirected Two Paths Problem
inferredcites →https://doi.org/10.1145/502090.502095openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_31openalex-snapshot
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_8openalex-snapshot
Algorithms for Junctions in Acyclic Digraphs
inferred← citeshttps://doi.org/10.1007/s10951-013-0353-xopenalex-snapshot
Solving the selective multi-category parallel-servicing problem
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.08.014openalex-snapshot
On provisioning diverse circuits in heterogeneous multi-layer optical networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.025openalex-snapshot
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
inferred← citeshttps://doi.org/10.1109/drcn.2011.6076901openalex-snapshot
SRLG-diverse routing of multiple circuits in a heterogeneous optical transport network
inferred← citeshttps://doi.org/10.1109/tcbb.2020.3040910openalex-snapshot
Maximum Covering Subtrees for Phylogenetic Networks
inferred← citeshttps://doi.org/10.1145/3184137openalex-snapshot
Competitive Packet Routing with Priority Lists
inferred← citeshttps://doi.org/10.11606/t.45.2013.tde-13022014-083516openalex-snapshot
Algoritmos para junções em digrafos acíclicos e uma aplicação na Antropologia
inferred← citeshttps://doi.org/10.48550/arxiv.1204.3113openalex-snapshot
Algorithms for Junctions in Directed Acyclic Graphs
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.