scientific article; zbMATH DE number 742959

MaRDI QIDQ4763401zbMATH OpenFDO

Authors Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert E. Tarjan

Publication date 11 April 1995

zbMATH Keywords

undirected graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing Minimal Spanning Subgraphs in Linear Time
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• On Finding Minimal Two-Connected Subgraphs
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• Biconnectivity approximations and graph carvings

Cited in

(12)

• Generating 3-vertex connected spanning subgraphs
• Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
• Linear time algorithms for graph search and connectivity determination on complement graphs.
• Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
• Computing Minimal Spanning Subgraphs in Linear Time
• On Finding Minimal Two-Connected Subgraphs
• Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
• Approximating unweighted connectivity problems in parallel
• A linear-time algorithm for finding a minimum spanning pseudoforest
• A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• A linear time algorithm for the bottleneck biconnected spanning subgraph problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763401)