On the public citation graph

The design of survivable directed networks

https://doi.org/10.1007/bf02109865
0 signed · 34 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/net.3230040204openalex-snapshot
Disjoint paths in a network
inferredcites →https://doi.org/10.1002/net.3230130405openalex-snapshot
The perfectly matchable subgraph polytope of a bipartite graph
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01582573openalex-snapshot
The Steiner tree problem I: Formulations, compositions and extension of facets
inferredcites →https://doi.org/10.1007/bf01585735openalex-snapshot
Minimum-weight two-connected spanning networks
inferredcites →https://doi.org/10.1007/bf01587087openalex-snapshot
On the facial structure of the set covering polytope
inferredcites →https://doi.org/10.1007/bf01935369openalex-snapshot
Generalized steiner problem in outerplanar networks
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1007/bfb0088963openalex-snapshot
Design of Survivable Networks
inferredcites →https://doi.org/10.1016/0166-218x(90)90069-oopenalex-snapshot
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
inferredcites →https://doi.org/10.1016/0166-218x(93)90086-4openalex-snapshot
Directed Steiner problems with connectivity constraints
inferredcites →https://doi.org/10.1016/0196-6774(86)90018-0openalex-snapshot
Generalized steiner problem in series-parallel networks
inferredcites →https://doi.org/10.1090/dimacs/001openalex-snapshot
Polyhedral Combinatorics
inferredcites →https://doi.org/10.1090/dimacs/005/08openalex-snapshot
Polyhedral approaches to network survivability
inferredcites →https://doi.org/10.1109/tct.1969.1083004openalex-snapshot
The Design of Minimum-Cost Survivable Networks
inferredcites →https://doi.org/10.1137/0205044openalex-snapshot
Augmentation Problems
inferredcites →https://doi.org/10.1137/0403043openalex-snapshot
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
inferredcites →https://doi.org/10.1137/0405024openalex-snapshot
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
inferredcites →https://doi.org/10.1137/0802024openalex-snapshot
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
inferredcites →https://doi.org/10.1287/opre.37.4.531openalex-snapshot
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints
inferredcites →https://doi.org/10.1287/opre.40.2.309openalex-snapshot
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
inferredcites →https://doi.org/10.2307/1907816openalex-snapshot
Activity Analysis of Production and Allocation
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming

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.21667openalex-snapshot
Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_11openalex-snapshot
Telecommunications Network Design
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_14openalex-snapshot
Capacity-Preserving Subgraphs of Directed Flow Networks
inferred← citeshttps://doi.org/10.1007/s00236-024-00475-7openalex-snapshot
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
inferred← citeshttps://doi.org/10.1007/s11235-015-9989-5openalex-snapshot
Network survivability modeling and analysis for power-aware MANETs by Markov regenerative processes
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2009.05.004openalex-snapshot
Maximal covering with network survivability requirements in wireless mesh networks
inferred← citeshttps://doi.org/10.1023/a:1010058513558openalex-snapshot
Survivable Network Design: The State of the Art
inferred← citeshttps://doi.org/10.1023/a:1014513809519openalex-snapshot
Hop Constrained Network Design Problem with Partial Survivability
inferred← citeshttps://doi.org/10.1023/a:1015445501694openalex-snapshot
Design of Survivable Networks with Connectivity Requirements
inferred← citeshttps://doi.org/10.1023/a:1015493417623openalex-snapshot
Capacity Requirements for Node and Arc Survivable Networks
inferred← citeshttps://doi.org/10.2139/ssrn.5249772openalex-snapshot
Approximation and Fpt Algorithms for Finding Dm-Irreducible Spanning Subgraphs
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.