A Graph Reduction Step Preserving Element-Connectivity and Applications
From MaRDI portal
Publication:3638039
DOI10.1007/978-3-642-02927-1_22zbMath1247.05236OpenAlexW1577694003MaRDI QIDQ3638039
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
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items
On trees and unicyclic graphs with equal forcing-type numbers ⋮ Total forcing sets and zero forcing sets in trees ⋮ Zero forcing in triangulations ⋮ UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS ⋮ On graphs maximizing the zero forcing number ⋮ Unnamed Item ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ On the total forcing number of a graph ⋮ The forcing number of graphs with given girth ⋮ An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ Bounds on the connected forcing number of a graph ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ A note on Rooted Survivable Networks ⋮ Zero forcing in claw-free cubic graphs ⋮ Note on forcing problem of trees ⋮ On extremal graphs for zero forcing number
This page was built for publication: A Graph Reduction Step Preserving Element-Connectivity and Applications
