A note on finding the bridges of a graph
From MaRDI portal
Publication:1844076
DOI10.1016/0020-0190(74)90003-9zbMath0282.68018OpenAlexW2118966355WikidataQ56485278 ScholiaQ56485278MaRDI QIDQ1844076
Publication date: 1974
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(74)90003-9
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) General topics in the theory of software (68N01) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (46)
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges ⋮ Destroying Bicolored $P_3$s by Deleting Few Edges ⋮ Bayesian variable selection for correlated covariates via colored cliques ⋮ Optimal In-place Algorithms for Basic Graph Problems ⋮ Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ Finding the detour-critical edge of a shortest path between two nodes ⋮ An efficient distributed bridge-finding algorithm ⋮ Efficient enumeration of graph orientations with sources ⋮ Structured Connectivity Augmentation ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ On orientations and shortest paths ⋮ Polynomial-time optimal liveness enforcement for guidepath-based transport systems ⋮ Approximation algorithms for orienting mixed graphs ⋮ Constant amortized time enumeration of Eulerian trails ⋮ Exact enumeration of self-avoiding walks on critical percolation clusters in 2–7 dimensions ⋮ Combinatorial acyclicity models for potential‐based flows ⋮ The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs ⋮ Connected power domination in graphs ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ An Edge Centrality Measure Based on the Kemeny Constant ⋮ Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs ⋮ A genetic approach for the 2‐edge‐connected minimum branch vertices problem ⋮ A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs ⋮ Strategyproof auction mechanisms for network procurement ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ Parallel algorithms for connectivity problems in graph theory ⋮ Generating cut conjunctions in graphs and related problems ⋮ A simplified algorithm computing all \(s-t\) bridges and articulation points ⋮ Approximation Algorithms for Orienting Mixed Graphs ⋮ Polynomial time algorithm for min-ranks of graphs with simple tree structures ⋮ Complexity and computation of connected zero forcing ⋮ Tropical hyperelliptic curves in the plane ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ Unnamed Item ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Rainbow connection number and radius ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Yet another optimal algorithm for 3-edge-connectivity ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph ⋮ Space efficient linear time algorithms for BFS, DFS and applications ⋮ A linear algorithm for the number of degree constrained subforests of a tree ⋮ A general program scheme for finding bridges ⋮ A faster computation of the most vital edge of a shortest path ⋮ Safety in \(s\)-\(t\) paths, trails and walks
Uses Software
Cites Work
This page was built for publication: A note on finding the bridges of a graph
