On the existence of a connected component of a graph

DOI10.3233/COM-150039zbMath1337.03086arXiv1406.4786OpenAlexW1895484323MaRDI QIDQ3195646

Carl Mummert, Jeffry L. Hirst, Kirill Gura

Publication date: 20 October 2015

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.4786

zbMATH Keywords

partitiongraphparallelizationreverse mathematicscomponentconnectedWeihrauch reducibility

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (4)

The uniform content of partial and linear orders ⋮ Primitive recursive reverse mathematics ⋮ Reverse Mathematics of Matroids ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• On the strength of the finite intersection principle
• Closed choice and a uniform low basis theorem
• Connected components of graphs and reverse mathematics
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Computability of the Radon-Nikodym Derivative
• Effective Borel measurability and reducibility of functions

This page was built for publication: On the existence of a connected component of a graph