On the public citation graph

Finding thet-join structure of graphs

https://doi.org/10.1007/bf02592020
0 signed · 21 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-36478-1_3openalex-snapshot
Matching: A Well-Solved Class of Integer Linear Programs
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-51576-7_6openalex-snapshot
The Chinese Postman Problem
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01902352openalex-snapshot
2-Matchings and 2-covers of hypergraphs
inferredcites →https://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferredcites →https://doi.org/10.1007/bfb0121011openalex-snapshot
Covering directed and odd cuts
inferredcites →https://doi.org/10.1016/0012-365x(87)90246-9openalex-snapshot
A quick proof of Seymour's theorem on t-joins
inferredcites →https://doi.org/10.1088/0305-4470/15/2/033openalex-snapshot
Morphology of ground states of two-dimensional frustration model
inferredcites →https://doi.org/10.1112/plms/s3-42.1.178openalex-snapshot
On Odd Cuts and Plane Multicommodity Flows
inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot
Paths, Trees, and Flowers

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1520-6750(198808)35:4<571::aid-nav3220350410>3.0.co;2-lopenalex-snapshot
New purification algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_20openalex-snapshot
The Path-Packing Structure of Graphs
inferred← citeshttps://doi.org/10.1007/bf02122558openalex-snapshot
The Schrijver system of odd join polyhedra
inferred← citeshttps://doi.org/10.1007/s10878-021-00772-8openalex-snapshot
Approximation algorithms with constant ratio for general cluster routing problems
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90173-fopenalex-snapshot
Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90032-sopenalex-snapshot
On shortest T-joins and packing T-cuts
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00590-3openalex-snapshot
Cycle cover property and CPP=SCC property are not equivalent
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70159-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80120-3openalex-snapshot
Chapter 3 Matching
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.