A Graph Reduction Step Preserving Element-Connectivity and Applications

DOI10.1007/978-3-642-02927-1_22MaRDI QIDQ3638039zbMATH OpenOpenAlexFDO

Authors Chandra Chekuri, Nitish Korula

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_22

zbMATH Keywords

edge-connectivityvertex-connectivityelement-connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• A graph reduction step preserving element-connectivity and packing Steiner trees and forests
• On element-connectivity preserving graph simplification
• scientific article; zbMATH DE number 1305440
• A primal–dual schema based approximation algorithm for the element connectivity problem
• Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

Cited in

(26)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• The extremal results for forcing problem of trees
• A note on Rooted Survivable Networks
• A graph reduction step preserving element-connectivity and packing Steiner trees and forests
• Semitotal forcing in claw-free cubic graphs
• A new reduction rule for the connection graph proof procedure
• The zero forcing number of graphs with the matching number and the cyclomatic number
• Total forcing versus total domination in cubic graphs
• Greedy algorithms for online survivable network design
• An improved approximation algorithm for minimum-cost subset k-connectivity (extended abstract)
• Total forcing sets and zero forcing sets in trees
• Zero forcing in claw-free cubic graphs
• On trees and unicyclic graphs with equal forcing-type numbers
• On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
• The zero forcing number of claw-free cubic graphs
• On graphs maximizing the zero forcing number
• Note on forcing problem of trees
• The forcing number of graphs with given girth
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
• Zero forcing in triangulations
• On element-connectivity preserving graph simplification
• On extremal graphs for zero forcing number
• On the total forcing number of a graph
• Bounds on the connected forcing number of a graph
• Total forcing and zero forcing in claw-free cubic graphs
• UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS

This page was built for publication: A Graph Reduction Step Preserving Element-Connectivity and Applications

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