scientific article; zbMATH DE number 7561367
From MaRDI portal
Publication:5091003
DOI10.4230/LIPIcs.ISAAC.2018.13MaRDI QIDQ5091003
Jens M. Schmidt, Johanna E. Preißer
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
big datavertex-connectivitylinear-timelarge graphsmaximum cardinality searchcomputing disjoint pathsmaximal adjacency orderingcertifying
Cites Work
- Unnamed Item
- Certifying algorithms
- Sparse connectivity certificates via MA orderings in graphs
- Rubber bands, convex embeddings and graph connectivity
- A correctness certificate for the Stoer-Wagner min-cut algorithm
- Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
- Grad und lokaler Zusammenhang in endlichen Graphen
- Contractions, Removals, and Certifying 3-Connectivity in Linear Time
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Graph Connectivity
- Finding the Vertex Connectivity of Graphs
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Network Flow and Testing Graph Connectivity
- A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
- A simple min-cut algorithm
This page was built for publication:
