Pages that link to "Item:Q1844076"

The following pages link to A note on finding the bridges of a graph (Q1844076):

Displaying 45 items.

• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
• Finding the detour-critical edge of a shortest path between two nodes (Q293313) (← links)
• Approximation algorithms for orienting mixed graphs (Q390889) (← links)
• Rainbow connection number and radius (Q742568) (← links)
• A general program scheme for finding bridges (Q787676) (← links)
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
• Generating cut conjunctions in graphs and related problems (Q930604) (← links)
• Yet another optimal algorithm for 3-edge-connectivity (Q1013081) (← links)
• On orientations and shortest paths (Q1123899) (← links)
• A faster computation of the most vital edge of a shortest path (Q1603442) (← links)
• Bayesian variable selection for correlated covariates via colored cliques (Q1621667) (← links)
• Efficient enumeration of graph orientations with sources (Q1647832) (← links)
• Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
• A self-stabilizing algorithm for detecting fundamental cycles in a graph (Q1807676) (← links)
• A linear algorithm for the number of degree constrained subforests of a tree (Q1836478) (← links)
• An efficient distributed bridge-finding algorithm (Q1894245) (← links)
• Complexity and computation of connected zero forcing (Q2012050) (← links)
• Tropical hyperelliptic curves in the plane (Q2025119) (← links)
• Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
• Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
• A simplified algorithm computing all \(s-t\) bridges and articulation points (Q2235263) (← links)
• Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
• Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
• Connected power domination in graphs (Q2424811) (← links)
• Polynomial-time optimal liveness enforcement for guidepath-based transport systems (Q2665316) (← links)
• Constant amortized time enumeration of Eulerian trails (Q2672609) (← links)
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
• Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
• Parallel algorithms for connectivity problems in graph theory (Q3802645) (← links)
• Structured Connectivity Augmentation (Q4555048) (← links)
• The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs (Q4596405) (← links)
• Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
• Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
• (Q5092430) (← links)
• Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
• Exact enumeration of self-avoiding walks on critical percolation clusters in 2–7 dimensions (Q5348308) (← links)
• A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
• On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
• On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
• Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
• An Edge Centrality Measure Based on the Kemeny Constant (Q6158484) (← links)
• A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)