On the public citation graph
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
0 signed · 336 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52921-7_51openalex-snapshot
Computing edge-connectivity in multiple and capacitated graphs
inferredcites →https://doi.org/10.1109/sfcs.1987.19openalex-snapshot
Determining edge connectivity in 0(nm)
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/0209016openalex-snapshot
Finding the Vertex Connectivity of Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190170302openalex-snapshot
On sparse subgraphs preserving connectivity properties
inferred← citeshttps://doi.org/10.1006/jagm.1994.1043openalex-snapshot
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
inferred← citeshttps://doi.org/10.1006/jagm.1996.0052openalex-snapshot
Improved Approximation Algorithms for Uniform Connectivity Problems
inferred← citeshttps://doi.org/10.1006/jagm.1996.0832openalex-snapshot
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components
inferred← citeshttps://doi.org/10.1006/jagm.1997.0855openalex-snapshot
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
inferred← citeshttps://doi.org/10.1006/jagm.1998.0931openalex-snapshot
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
inferred← citeshttps://doi.org/10.1006/jagm.1998.0983openalex-snapshot
Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
inferred← citeshttps://doi.org/10.1006/jagm.1998.0996openalex-snapshot
Parameterizing above Guaranteed Values: MaxSat and MaxCut
inferred← citeshttps://doi.org/10.1006/jagm.1999.1033openalex-snapshot
Decremental Dynamic Connectivity
inferred← citeshttps://doi.org/10.1006/jagm.1999.1040openalex-snapshot
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
inferred← citeshttps://doi.org/10.1006/jagm.1999.1055openalex-snapshot
Computing Vertex Connectivity: New Bounds from Old Techniques
inferred← citeshttps://doi.org/10.1006/jagm.2000.1144openalex-snapshot
An Efficient Algorithm for a Sparse k-Edge-Connectivity Certificate
inferred← citeshttps://doi.org/10.1006/jagm.2001.1167openalex-snapshot
Unique Maximum Matching Algorithms
inferred← citeshttps://doi.org/10.1006/jcss.1995.1065openalex-snapshot
Clique Partitions, Graph Compression and Speeding-Up Algorithms
inferred← citeshttps://doi.org/10.1007/11496915_31openalex-snapshot
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
inferred← citeshttps://doi.org/10.1007/11533719_88openalex-snapshot
Approximating the Longest Cycle Problem on Graphs with Bounded Degree
inferred← citeshttps://doi.org/10.1007/11537311_28openalex-snapshot
A Simple and Fast Min-cut Algorithm
inferred← citeshttps://doi.org/10.1007/11602613_19openalex-snapshot
Bisecting a Four-Connected Graph with Three Resource Sets
inferred← citeshttps://doi.org/10.1007/11602613_79openalex-snapshot
Complexity of the Min-Max (Regret) Versions of Cut Problems
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-44693-1_38openalex-snapshot
Approximation Algorithms for Minimum Size 2-Connectivity Problems
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_1openalex-snapshot
Dynamic Graph Algorithms with Applications
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-46632-0_43openalex-snapshot
Bisecting Two Subsets in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_16openalex-snapshot
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_47openalex-snapshot
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_47openalex-snapshot
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_184openalex-snapshot
Minimum augmentation to k-edge-connect specified vertices of a graph
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_58openalex-snapshot
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_81openalex-snapshot
Approximating minimum cuts under insertions
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_130openalex-snapshot
On mixed connectivity certificates
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_141openalex-snapshot
Output-sensitive reporting of disjoint paths (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_214openalex-snapshot
Maintaining minimum spanning trees in dynamic graphs
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_9openalex-snapshot
Bounded degree spanning trees
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_17openalex-snapshot
Cut Sparsifiers for Balanced Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_27openalex-snapshot
Exploration of k-Edge-Deficient Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_47openalex-snapshot
Cycle-Connected Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_26openalex-snapshot
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_19openalex-snapshot
I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_21openalex-snapshot
External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_43openalex-snapshot
Augmenting Local Edge-Connectivity between Vertices and Vertex Subsets in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_26openalex-snapshot
An Improved Algorithm for Finding Cycles Through Elements
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_18openalex-snapshot
On the Decay of Crossing Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_28openalex-snapshot
A Cubic Kernel for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_4openalex-snapshot
Compact Forbidden-Set Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_5openalex-snapshot
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_49openalex-snapshot
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_20openalex-snapshot
Minimum Cuts of Simple Graphs in Almost Always Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_8openalex-snapshot
Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
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-14553-7_1openalex-snapshot
Progress on Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_8openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_32openalex-snapshot
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_30openalex-snapshot
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_58openalex-snapshot
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
inferred← citeshttps://doi.org/10.1007/bf01302965openalex-snapshot
Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity
inferred← citeshttps://doi.org/10.1007/bf01582226openalex-snapshot
Implementing an efficient minimum capacity cut algorithm
inferred← citeshttps://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1007/bf02939489openalex-snapshot
AnO(k 2n2) algorithm to find ak-partition in ak-connected graph
inferred← citeshttps://doi.org/10.1007/bf03167564openalex-snapshot
A linear time algorithm for computing 3-edge-connected components in a multigraph
inferred← citeshttps://doi.org/10.1007/bfb0024510openalex-snapshot
Optimal fault-tolerant ATM-routings for biconnected graphs
inferred← citeshttps://doi.org/10.1007/bfb0053965openalex-snapshot
Approximating k-outconnected subgraph problems
inferred← citeshttps://doi.org/10.1007/bfb0054350openalex-snapshot
Recent developments in maximum flow algorithms
inferred← citeshttps://doi.org/10.1007/pl00009171openalex-snapshot
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/pl00009195openalex-snapshot
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line
inferred← citeshttps://doi.org/10.1007/s00224-007-2010-2openalex-snapshot
A Simple and Fast Min-Cut Algorithm
inferred← citeshttps://doi.org/10.1007/s00224-009-9234-2openalex-snapshot
A Cubic Kernel for Feedback Vertex Set and Loop Cutset
inferred← citeshttps://doi.org/10.1007/s00224-024-10179-7openalex-snapshot
Minimum Cut in $$O(m\log ^2 n)$$ Time
inferred← citeshttps://doi.org/10.1007/s00236-022-00421-5openalex-snapshot
Exploration of k-edge-deficient temporal graphs
inferred← citeshttps://doi.org/10.1007/s00446-019-00353-3openalex-snapshot
Fast distributed approximation for TAP and 2-edge-connectivity
inferred← citeshttps://doi.org/10.1007/s00453-001-0017-7openalex-snapshot
On Rooted Node-Connectivity Problems
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-008-9178-yopenalex-snapshot
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9450-9openalex-snapshot
Construction Sequences and Certifying 3-connectivity
inferred← citeshttps://doi.org/10.1007/s00453-010-9481-2openalex-snapshot
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9543-0openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/s00453-022-01053-4openalex-snapshot
Faster Cut Sparsification of Weighted Graphs
inferred← citeshttps://doi.org/10.1007/s00453-025-01355-3openalex-snapshot
On computing vertex connectivity of 1-planar graphs
inferred← citeshttps://doi.org/10.1007/s004539910004openalex-snapshot
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00454-005-1225-8openalex-snapshot
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-014-2828-6openalex-snapshot
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
inferred← citeshttps://doi.org/10.1007/s00778-016-0451-4openalex-snapshot
I/O efficient ECC graph decomposition via graph reduction
inferred← citeshttps://doi.org/10.1007/s101070050042openalex-snapshot
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
inferred← citeshttps://doi.org/10.1007/s10878-022-00979-3openalex-snapshot
Cycle-connected mixed graphs and related problems
inferred← citeshttps://doi.org/10.1007/s10922-008-9097-xopenalex-snapshot
A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks
inferred← citeshttps://doi.org/10.1007/s41109-021-00401-7openalex-snapshot
Probabilistic network sparsification with ego betweenness
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90015-9openalex-snapshot
k-connectivity and decomposition of graphs into forests
inferred← citeshttps://doi.org/10.1016/b978-012443895-8/50024-6openalex-snapshot
Reliable Data Flow in Network Systems in the Event of Failures
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.008openalex-snapshot
Sparse connectivity certificates via MA orderings in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.017openalex-snapshot
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.03.004openalex-snapshot
Bisecting a 4-connected graph with three resource sets
inferred← citeshttps://doi.org/10.1016/j.dam.2011.01.016openalex-snapshot
Graphs of separability at most 2
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.046openalex-snapshot
Compact cactus representations of all non-trivial min-cuts
inferred← citeshttps://doi.org/10.1016/j.disc.2004.11.011openalex-snapshot
Sparse graph certificates for mixed connectivity
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.11.008openalex-snapshot
Complexity of the min–max (regret) versions of min cut problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.05.020openalex-snapshot
On biconnected and fragile subgraphs of low diameter
inferred← citeshttps://doi.org/10.1016/j.icarus.2024.116451openalex-snapshot
Attribute recognition: A new method for grouping planetary images by visual characteristics, using the example of Mn-rich rocks in the floor of Gale crater, Mars
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.11.006openalex-snapshot
On computing minimum (s,t) -cuts in digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.06.004openalex-snapshot
Optimal per-edge processing times in the semi-streaming model
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.11.020openalex-snapshot
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.06.006openalex-snapshot
Biconnectivity, st-numbering and other applications of DFS using O(n) bits
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.11.002openalex-snapshot
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.01.004openalex-snapshot
Independence free graphs and vertex connectivity augmentation
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.03.005openalex-snapshot
On the decay of crossing numbers
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.07.004openalex-snapshot
The disjoint paths problem in quadratic time
inferred← citeshttps://doi.org/10.1016/j.jda.2009.06.003openalex-snapshot
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2013.03.005openalex-snapshot
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
inferred← citeshttps://doi.org/10.1016/j.orl.2004.05.008openalex-snapshot
Sparse certificates and removable cycles in -mixed -connected graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2015.12.017openalex-snapshot
Reconstructing edge-disjoint paths faster
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.010openalex-snapshot
A robust algorithm for bisecting a triconnected graph with two resource sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.029openalex-snapshot
A plane graph representation of triconnected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.043openalex-snapshot
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.032openalex-snapshot
On the complexity of the vector connectivity problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.015openalex-snapshot
Sparse certificates for 2-connectivity in directed graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00183-1openalex-snapshot
Minimum cost source location problem with vertex-connectivity requirements in digraphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00071-4openalex-snapshot
Linear time algorithms for graph search and connectivity determination on complement graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00071-xopenalex-snapshot
A correctness certificate for the Stoer–Wagner min-cut algorithm
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00189-5openalex-snapshot
Finding the k most vital edges with respect to minimum spanning trees for fixed k
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/s0166-218x(02)00199-3openalex-snapshot
Approximating minimum size {1,2}-connected networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00470-5openalex-snapshot
A note on the minimization of symmetric and general submodular functions
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00098-7openalex-snapshot
Finding the k most vital edges in the minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/s0169-7552(98)00259-1openalex-snapshot
Convergence routing on disjoint spanning trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00225-9openalex-snapshot
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00023-1openalex-snapshot
On mixed connectivity certificates
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80113-1openalex-snapshot
Problems concerning global connectivity of directed graphs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81016-8openalex-snapshot
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
inferred← citeshttps://doi.org/10.1023/a:1009739202898openalex-snapshot
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs
inferred← citeshttps://doi.org/10.1023/a:1009804919645openalex-snapshot
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
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.1093/ietisy/e89-d.4.1490openalex-snapshot
A Memory Grouping Method for Reducing Memory BIST Logic of System-on-Chips
inferred← citeshttps://doi.org/10.1109/24.106784openalex-snapshot
System failure-frequency analysis using a differential operator
inferred← citeshttps://doi.org/10.1109/24.106785openalex-snapshot
Counting the number of minimum cuts in undirected multigraphs
inferred← citeshttps://doi.org/10.1109/71.946661openalex-snapshot
Fully dynamic maintenance of k-connectivity in parallel
inferred← citeshttps://doi.org/10.1109/access.2023.3281266openalex-snapshot
MapReduce for Graphs Processing: New Big Data Algorithm for 2-Edge Connected Components and Future Ideas
inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594763openalex-snapshot
A memory grouping method for sharing memory bist logic
inferred← citeshttps://doi.org/10.1109/depcos-relcomex.2008.35openalex-snapshot
Designing Fault Tolerant Networks Topologies Based on Greedy Algorithm
inferred← citeshttps://doi.org/10.1109/focs.2011.53openalex-snapshot
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1109/focs.2012.29openalex-snapshot
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
inferred← citeshttps://doi.org/10.1109/focs.2016.96openalex-snapshot
A Fast and Simple Unbiased Estimator for Network (Un)reliability
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00017openalex-snapshot
Deterministic Min-cut in Poly-logarithmic Max-flows
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00080openalex-snapshot
Hypergraph -cut for fixed in deterministic polynomial time
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00111openalex-snapshot
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00112openalex-snapshot
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00055openalex-snapshot
Cut Query Algorithms with Star Contraction
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00080openalex-snapshot
Deterministic Small Vertex Connectivity in Almost Linear Time
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00098openalex-snapshot
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00014openalex-snapshot
Minor Containment and Disjoint Paths in Almost-Linear Time
inferred← citeshttps://doi.org/10.1109/globecom54140.2023.10437754openalex-snapshot
Efficient Routing Method for Reducing Significant Outages in Optical Networks
inferred← citeshttps://doi.org/10.1109/glocom.1994.513401openalex-snapshot
Design and performance of convergence routing on multiple spanning trees
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116914openalex-snapshot
Simple parallel biconnectivity algorithms for multicore platforms
inferred← citeshttps://doi.org/10.1109/icapp.1995.472215openalex-snapshot
Fast parallel algorithms for testing k-connectivity of directed and undirected graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00019openalex-snapshot
Preserving K-Connectivity in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485859openalex-snapshot
Optimizing Network Reliability via Best-First Search over Decision Diagrams
inferred← citeshttps://doi.org/10.1109/iscas.2014.6865752openalex-snapshot
Node voltages in nonlinear resistive circuits enable new approach to the minimum cut problem
inferred← citeshttps://doi.org/10.1109/monetec55448.2022.9960759openalex-snapshot
Flooding Topology Algorithms for Computer Networks
inferred← citeshttps://doi.org/10.1109/pacificvis64226.2025.00006openalex-snapshot
New Quality Metrics for Connectivity-faithful Sampling and Drawing of Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185419openalex-snapshot
Finding the hidden path: time bounds for all-pairs shortest paths
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185451openalex-snapshot
On-line maintenance of the four-connected components of a graph
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185453openalex-snapshot
Applications of a poset representation to edge connectivity and graph rigidity
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365718openalex-snapshot
Fully dynamic cycle-equivalence in graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492466openalex-snapshot
A representation of cuts within 6/5 times the edge connectivity with applications
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548488openalex-snapshot
Approximating minimum-size k-connected spanning subgraphs via matching
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548505openalex-snapshot
Computing vertex connectivity: new bounds from old techniques
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646090openalex-snapshot
Flows in undirected unit capacity networks
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892129openalex-snapshot
Using expander graphs to find vertex connectivity
inferred← citeshttps://doi.org/10.1109/tcad.2004.823353openalex-snapshot
Edge Separability-Based Circuit Clustering With Application to Multilevel Circuit Partitioning
inferred← citeshttps://doi.org/10.1109/tkde.2018.2819651openalex-snapshot
Uncertain Graph Sparsification
inferred← citeshttps://doi.org/10.1109/tnet.2011.2174648openalex-snapshot
On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths
inferred← citeshttps://doi.org/10.1109/tnet.2015.2440179openalex-snapshot
IP Fast Rerouting and Disjoint Multipath Routing With Three Edge-Independent Spanning Trees
inferred← citeshttps://doi.org/10.1109/tr.2014.2315957openalex-snapshot
Fast Recovery From Link Failures in Ethernet Networks
inferred← citeshttps://doi.org/10.1109/tsp.2006.890830openalex-snapshot
Hierarchical Inference of Unicast Network Topologies Based on End-to-End Measurements
inferred← citeshttps://doi.org/10.1109/tvcg.2025.3577533openalex-snapshot
GraphTrials: Visual Proofs of Graph Properties
inferred← citeshttps://doi.org/10.1121/1.3125324openalex-snapshot
Graph theory applied to noise and vibration control in statistical energy analysis models
inferred← citeshttps://doi.org/10.1137/0222013openalex-snapshot
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k -Vertex Connectivity
inferred← citeshttps://doi.org/10.1137/0222040openalex-snapshot
Finding Triconnected Components by Local Replacement
inferred← citeshttps://doi.org/10.1137/0222071openalex-snapshot
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1137/0405004openalex-snapshot
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
inferred← citeshttps://doi.org/10.1137/050633263openalex-snapshot
Approximating Longest Cycles in Graphs with Bounded Degrees
inferred← citeshttps://doi.org/10.1137/070705970openalex-snapshot
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
inferred← citeshttps://doi.org/10.1137/070705994openalex-snapshot
Fast Augmenting Paths by Random Sampling from Residual Graphs
inferred← citeshttps://doi.org/10.1137/090780894openalex-snapshot
The Balanced Decomposition Number and Vertex Connectivity
inferred← citeshttps://doi.org/10.1137/1.9781611973730.132openalex-snapshot
2-Edge Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.124openalex-snapshot
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.31openalex-snapshot
Connectivity Oracles for Graphs Subject to Vertex Failures
inferred← citeshttps://doi.org/10.1137/1.9781611974782.70openalex-snapshot
Computing minimum cuts in hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.74openalex-snapshot
Vertex Sparsification for Edge Connectivity
showing the first 200 of 332 · page through all 332
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.