On the public citation graph

Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity

https://doi.org/10.1007/bf01302965
0 signed · 51 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/jgt.3190110309openalex-snapshot
Vertex‐disjoint paths and edge‐disjoint branchings in directed graphs
inferredcites →https://doi.org/10.1002/jgt.3190130205openalex-snapshot
Three tree‐paths
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/978-3-642-69897-2openalex-snapshot
Data Structures and Algorithms 2
inferredcites →https://doi.org/10.1007/bf01758778openalex-snapshot
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
inferredcites →https://doi.org/10.1007/bf02122557openalex-snapshot
Rubber bands, convex embeddings and graph connectivity
inferredcites →https://doi.org/10.1007/bf02122800openalex-snapshot
Improved processor bounds for combinatorial problems in RNC
inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1016/0020-0190(82)90046-1openalex-snapshot
A probabilistic algorithm for vertex connectivity of graphs
inferredcites →https://doi.org/10.1016/0024-3795(89)90475-8openalex-snapshot
Orthogonal representations and connectivity of graphs
inferredcites →https://doi.org/10.1016/0095-8956(73)90018-xopenalex-snapshot
Connectivity in digraphs
inferredcites →https://doi.org/10.1016/0196-6774(88)90015-6openalex-snapshot
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
inferredcites →https://doi.org/10.1016/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1057/jors.1980.49openalex-snapshot
Packing and Covering in Combinatorics
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
inferredcites →https://doi.org/10.1137/0204034openalex-snapshot
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k
inferredcites →https://doi.org/10.1137/0209016openalex-snapshot
Finding the Vertex Connectivity of Graphs
inferredcites →https://doi.org/10.1137/0222013openalex-snapshot
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k -Vertex Connectivity
inferredcites →https://doi.org/10.1145/113379.113396openalex-snapshot
Processor efficient parallel solution of linear systems over an abstract field
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1999.1055openalex-snapshot
Computing Vertex Connectivity: New Bounds from Old Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_5openalex-snapshot
More on Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_7openalex-snapshot
On Finding Directed Trees with Many Leaves
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_62openalex-snapshot
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_32openalex-snapshot
Dominators, Directed Bipolar Orders, and Independent Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_26openalex-snapshot
Dominator Certification and Independent Spanning Trees: An Experimental Study
inferred← citeshttps://doi.org/10.1007/s00493-002-0006-8openalex-snapshot
Convex Embeddings and Bisections of 3-Connected Graphs 1
inferred← citeshttps://doi.org/10.1016/j.dam.2004.12.001openalex-snapshot
Balanced vertex-orderings of graphs
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00113openalex-snapshot
Minimum Cuts in Directed Graphs via Partial Sparsification
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00080openalex-snapshot
Deterministic Small Vertex Connectivity in Almost Linear Time
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062214openalex-snapshot
Optimal Construction of Redundant Multicast Trees in Directed Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548505openalex-snapshot
Computing vertex connectivity: new bounds from old techniques
inferred← citeshttps://doi.org/10.1137/060670158openalex-snapshot
Locating Servers for Reliability and Affine Embeddings
inferred← citeshttps://doi.org/10.1137/1.9781611975994.126openalex-snapshot
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
inferred← citeshttps://doi.org/10.1137/s0895480198333290openalex-snapshot
Directional Routing via Generalized st -Numberings
inferred← citeshttps://doi.org/10.1145/2764913openalex-snapshot
Dominator Tree Certification and Divergent Spanning Trees
inferred← citeshttps://doi.org/10.1145/3313276.3316394openalex-snapshot
Breaking quadratic time for small vertex connectivity and an approximation scheme
inferred← citeshttps://doi.org/10.1145/3564822openalex-snapshot
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/3717823.3718185openalex-snapshot
Breaking the 𝑂(𝑚𝑛)-Time Barrier for Vertex-Weighted Global Minimum Cut
inferred← citeshttps://doi.org/10.1145/3717823.3718316openalex-snapshot
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations
inferred← citeshttps://doi.org/10.48550/arxiv.1210.8303openalex-snapshot
Dominator Tree Certification and Independent Spanning Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05329openalex-snapshot
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07950openalex-snapshot
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot
Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.
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.