Testing Eulerianity and connectivity in directed sparse graphs (Q653336): Difference between revisions

@@ Property / cites work @@
+Efficient testing of large graphs
@@ Property / cites work: Efficient testing of large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
+Normal rank
@@ Property / cites work @@
+Testing subgraphs in directed graphs
@@ Property / cites work: Testing subgraphs in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501357
@@ Property / cites work: Q5501357 / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
+Normal rank
@@ Property / cites work @@
+Every Monotone Graph Property Is Testable
@@ Property / cites work: Every Monotone Graph Property Is Testable / rank @@
+Normal rank
@@ Property / cites work @@
+Testing properties of directed graphs: acyclicity and connectivity*
+Normal rank
@@ Property / cites work @@
+Q3549723
@@ Property / cites work: Q3549723 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Expansion in Bounded-Degree Graphs
@@ Property / cites work: Testing Expansion in Bounded-Degree Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3152421
@@ Property / cites work: Q3152421 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Directed vertex-connectivity augmentation
@@ Property / cites work: Directed vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+On the Query Complexity of Testing Orientations for Being Eulerian
+Normal rank
@@ Property / cites work @@
+Testing versus Estimation of Graph Properties
@@ Property / cites work: Testing versus Estimation of Graph Properties / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Q4527008
@@ Property / cites work: Q4527008 / rank @@
+Normal rank
@@ Property / cites work @@
+A sublinear bipartiteness tester for bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Property testing in bounded degree graphs
@@ Property / cites work: Property testing in bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Local Graph Partitions for Approximation and Testing
+Normal rank
@@ Property / cites work @@
+Independence free graphs and vertex connectivity augmentation
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Testing Bipartiteness in General Graphs
+Normal rank
@@ Property / cites work @@
+An Expansion Tester for Bounded Degree Graphs
@@ Property / cites work: An Expansion Tester for Bounded Degree Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Testing the expansion of a graph
@@ Property / cites work: Testing the expansion of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Testing the diameter of graphs
@@ Property / cites work: Testing the diameter of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4788610
@@ Property / cites work: Q4788610 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Property Testing on k-Vertex-Connectivity of Graphs
+Normal rank
@@ Property / cites work @@
+Testing \(k\)-edge-connectivity of digraphs
@@ Property / cites work: Testing \(k\)-edge-connectivity of digraphs / rank @@
+Normal rank