On the public citation graph

AnO(k 2n2) algorithm to find ak-partition in ak-connected graph

https://doi.org/10.1007/bf02939489
0 signed · 17 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/b138283openalex-snapshot
Graphs, Networks and Algorithms
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/bf01896190openalex-snapshot
A homology theory for spanning tress of a graph
inferredcites →https://doi.org/10.1016/0166-218x(85)90008-3openalex-snapshot
On the complexity of partitioning graphs into connected subgraphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-62495-3_58openalex-snapshot
A linear-time algorithm for four-partitioning four-connected planar graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_11openalex-snapshot
Cut and Flow Formulations for the Balanced Connected k-Partition Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_3openalex-snapshot
Evacuation of Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/s10898-012-0028-8openalex-snapshot
Max-min weight balanced connected partition
inferred← citeshttps://doi.org/10.1016/j.cor.2017.05.016openalex-snapshot
An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.12.059openalex-snapshot
Partitioning a graph into balanced connected classes: Formulations, separation and experiments
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.033openalex-snapshot
Approximation Results on Balanced Connected Partitions of Graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00083-5openalex-snapshot
A linear-time algorithm for four-partitioning four-connected planar graphs
inferred← citeshttps://doi.org/10.1109/hpsr.2010.5580277openalex-snapshot
2-SRLG-connected partitioning in optical networks
inferred← citeshttps://doi.org/10.1109/icelce.2010.5700745openalex-snapshot
A linear algorithm for resource four-partitioning four-connected planar graphs
inferred← citeshttps://doi.org/10.1364/jocn.7.000695openalex-snapshot
k-Connected Network Partitioning Under Shared Risk Link Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1810.11965openalex-snapshot
R-BBG$_2$: Recursive Bipartition of Bi-connected Graphs
inferred← citeshttps://doi.org/10.70675/c1380a84z992ez4dccz873az01b268947bbfopenalex-snapshot
Grands réseaux maillés basse énergie : protocoles minimalistes pour la synchronisation, la mesure de distance et le partitionnement
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.