Testing \(k\)-edge-connectivity of digraphs

DOI10.1007/s11424-010-9280-5zbMath1298.05151OpenAlexW2083157001MaRDI QIDQ469635

Hiro Ito, Yuichi Yoshida

Publication date: 11 November 2014

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-010-9280-5

zbMATH Keywords

graphdigraphproperty testing\(k\)-edge-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (5)

Property testing on \(k\)-vertex-connectivity of graphs ⋮ Testing the \((s,t)\) connectivity of graphs and digraphs ⋮ Testing Eulerianity and connectivity in directed sparse graphs ⋮ On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs ⋮ Testing the supermodular-cut condition

Cites Work

• On Testing Expansion in Bounded-Degree Graphs
• Property testing and its connection to learning and approximation
• Property Testing on k-Vertex-Connectivity of Graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Testing properties of directed graphs: acyclicity and connectivity*
• Property testing in bounded degree graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing \(k\)-edge-connectivity of digraphs