On the public citation graph

Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)

https://doi.org/10.1007/bfb0015432
0 signed · 35 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/bf01224737openalex-snapshot
Minimum block containing a given graph
inferredcites →https://doi.org/10.1007/bfb0032061openalex-snapshot
On-line graph algorithms with SPQR-trees
inferredcites →https://doi.org/10.1016/0022-0000(93)90050-7openalex-snapshot
A minimum 3-connectivity augmentation of a graph
inferredcites →https://doi.org/10.1073/pnas.48.7.1142openalex-snapshot
THE MAXIMUM CONNECTIVITY OF A GRAPH
inferredcites →https://doi.org/10.1109/sfcs.1991.185418openalex-snapshot
A linear time algorithm for triconnectivity augmentation
inferredcites →https://doi.org/10.1109/sfcs.1991.185451openalex-snapshot
On-line maintenance of the four-connected components of a graph
inferredcites →https://doi.org/10.1109/sfcs.1992.267817openalex-snapshot
On four-connecting a triconnected graph
inferredcites →https://doi.org/10.1109/tct.1970.1083185openalex-snapshot
Connectivity considerations in the design of survivable networks
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0205044openalex-snapshot
Augmentation Problems
inferredcites →https://doi.org/10.1137/0206003openalex-snapshot
Smallest Augmentations to Biconnect a Graph
inferredcites →https://doi.org/10.1137/0217034openalex-snapshot
A Graph Theoretic Approach to Statistical Data Security
inferredcites →https://doi.org/10.1137/0222056openalex-snapshot
Finding a Smallest Augmentation to Biconnect a Graph
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.3138/9781487584863openalex-snapshot
Connectivity in Graphs
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.4openalex-snapshot
Multigraph augmentation under biconnectivity and general edge‐connectivity requirements
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_27openalex-snapshot
A Near Optimal Algorithm for Vertex Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_26openalex-snapshot
On the Minimum Augmentation of an ℓ-Connected Graph to a k-Connected Graph
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_26openalex-snapshot
Simpler and Faster Vertex-Connectivity Augmentation Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_36openalex-snapshot
Augmenting a(k—1)-Vertex-ConnectedMultigraph to an ℓ-Edge-Connected and k-Vertex-Connected Multigraph
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_18openalex-snapshot
k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_12openalex-snapshot
Augmenting edge and vertex connectivities simultaneously
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_120openalex-snapshot
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bfb0009497openalex-snapshot
Optimal augmentation for bipartite componentwise biconnectivity in linear time
inferred← citeshttps://doi.org/10.1007/s00453-005-1151-4openalex-snapshot
Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph
inferred← citeshttps://doi.org/10.1007/s00453-007-9127-1openalex-snapshot
Smallest Bipartite Bridge-Connectivity Augmentation
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00349-3openalex-snapshot
Graph connectivity and its augmentation: applications of MA orderings
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00223-7openalex-snapshot
Simpler and faster biconnectivity augmentation
inferred← citeshttps://doi.org/10.1023/a:1009884922499openalex-snapshot
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph
inferred← citeshttps://doi.org/10.1109/acc.2012.6314898openalex-snapshot
Efficient topology optimization for a wired networked system by adding wireless communication
inferred← citeshttps://doi.org/10.1109/iscas.1997.621905openalex-snapshot
A linear time algorithm for minimum augmentation to 3-connect specified vertices of a graph
inferred← citeshttps://doi.org/10.1109/iscas.2009.5118417openalex-snapshot
Minimum augmentation to tri-connect a bi-connected graph with upper bounds on vertex-degree
inferred← citeshttps://doi.org/10.1137/s0895480196303216openalex-snapshot
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
inferred← citeshttps://doi.org/10.15807/jorsj.47.224openalex-snapshot
NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES( Network Design, Control and Optimization)
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.