On the public citation graph
Path problems in skew-symmetric graphs
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01581152openalex-snapshot
Minimum cost multiflows in undirected networks
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/s0166-218x(96)00017-0openalex-snapshot
On paths avoiding forbidden pairs of vertices in a graph
inferredcites →https://doi.org/10.1109/tse.1976.233819openalex-snapshot
On Two Problems in the Generation of Program Test Paths
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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-0037(199901)33:1<1::aid-net1>3.0.co;2-mopenalex-snapshot
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
inferred← citeshttps://doi.org/10.1002/net.10002openalex-snapshot
Balanced network flows. VII. Primal‐dual algorithms
inferred← citeshttps://doi.org/10.1002/net.1014openalex-snapshot
Balanced network flows. V. Cycle‐canceling algorithms
inferred← citeshttps://doi.org/10.1002/net.1015openalex-snapshot
Balanced network flows. VI. Polyhedral descriptions
inferred← citeshttps://doi.org/10.1007/11753728_6openalex-snapshot
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_7openalex-snapshot
O(log n)-Approximation Algorithms for Bipartiteness Ratio
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_20openalex-snapshot
Shortest Paths in Nearly Conservative Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_10openalex-snapshot
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_39openalex-snapshot
Parameterized Approximations via d-Skew-Symmetric Multicut
inferred← citeshttps://doi.org/10.1007/s00453-019-00613-5openalex-snapshot
Making Bidirected Graphs Strongly Connected
inferred← citeshttps://doi.org/10.1007/s10107-004-0505-zopenalex-snapshot
Maximum skew-symmetric flows and matchings
inferred← citeshttps://doi.org/10.1007/s10878-011-9377-3openalex-snapshot
Min-cost multiflows in node-capacitated undirected networks
inferred← citeshttps://doi.org/10.1016/j.dam.2007.02.012openalex-snapshot
Free multiflows in bidirected and skew-symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.09.005openalex-snapshot
Minimum mean cycle problem in bidirected and skew-symmetric graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.11.001openalex-snapshot
Faster Graph bipartization
inferred← citeshttps://doi.org/10.1101/2021.01.12.426317openalex-snapshot
State-of-the-art structural variant calling: What went conceptually wrong and how to fix it?
inferred← citeshttps://doi.org/10.1134/s0032946006040089openalex-snapshot
On flows in simple bidirected and skew-symmetric networks
inferred← citeshttps://doi.org/10.1137/1.9781611973402.126openalex-snapshot
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
inferred← citeshttps://doi.org/10.1145/3128600openalex-snapshot
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
inferred← citeshttps://doi.org/10.1145/3291531openalex-snapshot
A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications
inferred← citeshttps://doi.org/10.1186/s13059-023-03009-5openalex-snapshot
MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.23889/suthesis.57815openalex-snapshot
The combinatorics of minimal unsatisfiability: connecting to graph theory
inferred← citeshttps://doi.org/10.25148/etd.fi14040860openalex-snapshot
Two-Bit Pattern Analysis For Quantitative Information Flow
inferred← citeshttps://doi.org/10.3103/s0027132207020076openalex-snapshot
An application of the structural theory of acyclic skew-symmetric graphs
inferred← citeshttps://doi.org/10.4236/ojdm.2013.33028openalex-snapshot
Balanced Min Cost Flow on Skew Symmetric Networks with Convex Costs
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0125openalex-snapshot
On Min-Cost Multiflow Problem in Node-Capacitated Undirected Networks
inferred← citeshttps://doi.org/10.48550/arxiv.math/0304290openalex-snapshot
Maximum Skew-Symmetric Flows and Matchings
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700729openalex-snapshot
Additional file 1 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700732openalex-snapshot
Additional file 2 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700735openalex-snapshot
Additional file 3 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700738openalex-snapshot
Additional file 4 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700741openalex-snapshot
Additional file 5 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700744openalex-snapshot
Additional file 6 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700747openalex-snapshot
Additional file 7 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700750openalex-snapshot
Additional file 8 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700753openalex-snapshot
Additional file 9 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700756openalex-snapshot
Additional file 10 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700759openalex-snapshot
Additional file 11 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700762openalex-snapshot
Additional file 12 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700765openalex-snapshot
Additional file 13 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700768openalex-snapshot
Additional file 14 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6084/m9.figshare.23700774openalex-snapshot
Additional file 15 of MSV: a modular structural variant caller that reveals nested and complex rearrangements by unifying breakends inferred directly from reads
inferred← citeshttps://doi.org/10.6100/ir643995openalex-snapshot
Improved verification methods for concurrent systems
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.